mstree.prim
Compute minimum spanning tree for an undirected graph
Compute minimum spanning tree for an undirected graph
 Keywords
 models
Usage
mstree.prim(g)
Arguments
 g
 an instance of the
graph
class withedgemode
“undirected”
Details
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.
Value

A list of
 edges
 the edges that form the minimum spanning tree
 weights
 the total weight of the minimum spanning tree
References
Boost Graph Library ( www.boost.org/libs/graph/doc/index.html )
The Boost Graph Library: User Guide and Reference Manual; by Jeremy G. Siek, LieQuan Lee, and Andrew Lumsdaine; (AddisonWesley, Pearson Education Inc., 2002), xxiv+321pp. ISBN 0201729148
See Also
Examples
con < file(system.file("XML/conn2.gxl",package="RBGL"))
coex < fromGXL(con)
close(con)
mstree.prim(coex)
Community examples
Looks like there are no examples yet.