Function
primsAlgorithm
Computes a minimum spanning tree on a graph.
Include Headers
seqan/graph_algorithms.h
Parameters
|  In-parameter:An undirected graph. Types:  Undirected Graph | |
|  In-parameter:A source vertex. Types:  VertexDescriptor | |
|  In-parameter:Edge weights. | |
|  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
See Also
SeqAn - Sequence Analysis Library - www.seqan.de