Function
prims_algorithm
Computes a minimum spanning tree on a graph.
prims_algorithm(g, source, weight, predecessor)
Parameters
g
In-parameter:A graph.
Types: Graph
source
In-parameter:A source vertex.
Types: VertexDescriptor
weight
In-parameter:Edge weights.
predecessor
Out-parameter:A property map.
Remarks: A property map that represents predecessor relationships among vertices. It determines a minimum spanning tree.
Return Values
void.
Example Programs
Prims Algorithm
SeqAn - Sequence Analysis Library - www.seqan.de