prim.minST {RBGL} | R Documentation |
Compute minimum spanning tree for an undirected graph
prim.minST(g)
g |
an instance of the graph class with edgemode
“undirected” |
This is Prim's algorithm for solving the minimum spanning tree problem for an undirected graph with weighted edges. A MST is a set of edges that connects all the vertices in the graph where the total weight of the edges in the tree is minimized.
edges |
the edges that form the minimum spanning tree |
weight |
the total weight of the minimum spanning tree |
Li Long <li.long@isb-sib.ch>
Boost Graph Library by Siek et al.
coex <- fromGXL(file(system.file("XML/conn2.gxl",package="RBGL"))) prim.minST(coex)