Function
kruskals_algorithm
Computes a minimum spanning tree on a graph.
kruskals_algorithm(g, source, weight, edges)
Parameters
g
In-parameter:A graph.
Types: Graph
source
In-parameter:A source vertex.
Types: VertexDescriptor
weight
In-parameter:Edge weights.
edges
Out-parameter:Array of vertex descriptors.
Remarks: Array or string where two consecutive entries are an edge.
Return Values
void.
Example Programs
Kruskals Algorithm
SeqAn - Sequence Analysis Library - www.seqan.de