\Header{combGOGraph}{Combine GO Graphs}
\keyword{manip}{combGOGraph}
\begin{Description}\relax
Given two GO graphs this function combines them into a single graph
and returns that.
\end{Description}
\begin{Usage}
\begin{verbatim}
combGOGraph(g1, g2)
\end{verbatim}
\end{Usage}
\begin{Arguments}
\begin{ldescription}
\item[\code{g1}] An instance of a \code{graph}.
\item[\code{g2}] An instance of a \code{graph}. 
\end{ldescription}
\end{Arguments}
\begin{Details}\relax
A new \code{graph} object is created by linking the two supplied
graphs together. Since they are both GO graphs they will share, at
least, the GO root node.

This could probably be replaced by the \code{union} function in the
\code{graph} package.
\end{Details}
\begin{Value}
A graph containing the union of the nodes and edges in the two
graphs.
\end{Value}
\begin{Author}\relax
R. Gentleman
\end{Author}
\begin{SeeAlso}\relax
\code{\Link{union}}
\end{SeeAlso}
\begin{Examples}
\begin{ExampleCode}
 g1 <- oneGOGraph("GO:0003680", GOMFPARENTS)
 g2 <- oneGOGraph("GO:0003701", GOMFPARENTS)
 g3 <- combGOGraph(g1, g2)
\end{ExampleCode}
\end{Examples}

