Function
kruskalsAlgorithm
Computes a minimum spanning tree on a graph.
kruskalsAlgorithm(g, source, weight, edges)
Include Headers
seqan/graph_algorithms.h
Parameters
g
In-parameter:An undirected graph.
source
In-parameter:A source vertex.
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
SeqAn - Sequence Analysis Library - www.seqan.de
 

Page built @2011/02/08 21:37:05