\HeaderA{GOLeaves}{Identify the leaves in a GO Graph}{GOLeaves}
\keyword{manip}{GOLeaves}
\begin{Description}\relax
Given a GO graph this function returns the node labels for all leaves
in the graph. A leaf is defined to be a node with only out-edges and
no in-edges.
\end{Description}
\begin{Usage}
\begin{verbatim}
GOLeaves(inG)
\end{verbatim}
\end{Usage}
\begin{Arguments}
\begin{ldescription}
\item[\code{inG}] An instance of a GO graph. 
\end{ldescription}
\end{Arguments}
\begin{Details}\relax
All nodes in \code{inG} are inspected for in-edges and those with none
are returned.

This should probably be replaced by a function in the graph package
that identifies leaves, there is nothing special about GO here.
\end{Details}
\begin{Value}
A vector of the node labels for those nodes with no in-edges.
\end{Value}
\begin{Author}\relax
R. Gentleman
\end{Author}
\begin{SeeAlso}\relax
\code{\LinkA{makeGOGraph}{makeGOGraph}}
\end{SeeAlso}
\begin{Examples}
\begin{ExampleCode}
 g1 <- oneGOGraph("GO:0003680", GOMFPARENTS)
 g2 <- oneGOGraph("GO:0003701", GOMFPARENTS)
 g3 <- join(g1, g2)
 GOLeaves(g3)
\end{ExampleCode}
\end{Examples}

