Compute minimum spanning tree for an undirected graph
Compute minimum spanning tree for an undirected graph
mstree.prim(g)
g |
an instance of the |
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.
A list of
edges |
the edges that form the minimum spanning tree |
weights |
the total weight of the minimum spanning tree |
Li Long <li.long@isb-sib.ch>
Boost Graph Library ( www.boost.org/libs/graph/doc/index.html )
The Boost Graph Library: User Guide and Reference Manual; by Jeremy G. Siek, Lie-Quan Lee, and Andrew Lumsdaine; (Addison-Wesley, Pearson Education Inc., 2002), xxiv+321pp. ISBN 0-201-72914-8
con <- file(system.file("XML/conn2.gxl",package="RBGL"))
coex <- fromGXL(con)
close(con)
mstree.prim(coex)Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.