\HeaderA{prim.minST}{Compute minimum spanning tree for an undirected graph}{prim.minST}
\keyword{models}{prim.minST}
\begin{Description}\relax
Compute minimum spanning tree for an undirected graph
\end{Description}
\begin{Usage}
\begin{verbatim}
prim.minST(g)
\end{verbatim}
\end{Usage}
\begin{Arguments}
\begin{ldescription}
\item[\code{g}] an instance of the \code{graph} class with \code{edgemode}
\dQuote{undirected}
\end{ldescription}
\end{Arguments}
\begin{Details}\relax
This is Prim's algorithm for solving the minimum spanning tree problem for an 
undirected graph with weighted edges. 
See documentations on this function in Boost Graph Library for more details.
\end{Details}
\begin{Value}
A list of
\begin{ldescription}
\item[\code{edges}] the edges that form the minimum spanning tree
\item[\code{weights}] the total weight of the minimum spanning tree
\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
\code{\LinkA{mstree.kruskal}{mstree.kruskal}}
\end{SeeAlso}
\begin{Examples}
\begin{ExampleCode}
coex <- fromGXL(file(system.file("XML/conn2.gxl",package="RBGL"), open="r"))
prim.minST(coex)
\end{ExampleCode}
\end{Examples}

