Function
kruskals_algorithm
Computes a minimum spanning tree on a graph.
Parameters
In-parameter:An undirected graph. Types: Undirected graph | |
In-parameter:A source vertex. Types: VertexDescriptor | |
In-parameter:Edge weights. | |
Out-parameter:Array of vertex descriptors. Remarks: Array or string where two consecutive entries are an edge. |
Return Values
void.
Example Programs
See Also
SeqAn - Sequence Analysis Library - www.seqan.de