Function
dijkstra
Computes shortest paths from a single source in a graph.
Parameters
In-parameter:A graph. Types: Graph | |
In-parameter:A source vertex. Types: VertexDescriptor | |
In-parameter:A weight map. Remarks: A property map with edge weights. Edge weights have to be nonnegative. | |
Out-parameter:A property map. Remarks: A property map that represents predecessor relationships among vertices. It determines a shortest-paths tree. | |
Out-parameter:A property map. Remarks: Indicates for each vertex the distance from the source. |
Return Values
void
Remarks
Edge weights have to be nonnegative.
Example Programs
See Also
SeqAn - Sequence Analysis Library - www.seqan.de