\HeaderA{transitive.closure}{Compute transitive closure of a directed graph}{transitive.closure}
\keyword{models}{transitive.closure}
\begin{Description}\relax
Compute  transitive closure of a directed graph
\end{Description}
\begin{Usage}
\begin{verbatim}
transitive.closure(g)
\end{verbatim}
\end{Usage}
\begin{Arguments}
\begin{ldescription}
\item[\code{g}] an instance of the \code{graph} class 
\end{ldescription}
\end{Arguments}
\begin{Details}\relax
This function calculates the transitive closure of a directed graph.  
See documentation on this function in Boost Graph Library for more details.
\end{Details}
\begin{Value}
A list of
\begin{ldescription}
\item[\code{vertices}] the vertices of the transitive closure 
\item[\code{edges}] the edges of the transitive closure 
\end{ldescription}
\end{Value}
\begin{Author}\relax
Li Long <li.long@isb-sib.ch>
\end{Author}
\begin{References}\relax
Boost Graph Library by Siek et al.
\end{References}
\begin{SeeAlso}\relax
\end{SeeAlso}
\begin{Examples}
\begin{ExampleCode}
coex <- fromGXL(file(system.file("XML/dijkex.gxl",package="RBGL"), open="r"))
transitive.closure(coex)
\end{ExampleCode}
\end{Examples}

