prim.minST {RBGL}R Documentation

Compute minimum spanning tree for an undirected graph

Description

Compute minimum spanning tree for an undirected graph

Usage

prim.minST(g)

Arguments

g an instance of the graph class with edgemode “undirected”

Details

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.

Value

edges the edges that form the minimum spanning tree
weight the total weight of the minimum spanning tree

Author(s)

Li Long <li.long@isb-sib.ch>

References

Boost Graph Library by Siek et al.

See Also

Examples

coex <- fromGXL(file(system.file("XML/conn2.gxl",package="RBGL")))
prim.minST(coex)

[Package RBGL version 1.3.8 Index]