| Function dijkstra Computes shortest paths from a single source in a graph. dijkstra(g, source, weight, predecessor, distance) Parameters
g | In-parameter:A graph. Types: Graph
source | In-parameter:A source vertex. Types: VertexDescriptor
weight | In-parameter:A weight map. Remarks: A property map with edge weights. Edge weights have to be nonnegative.
predecessor | Out-parameter:A property map. Remarks: A property map that represents predecessor relationships among vertices. It determines a shortest-paths tree.
distance | 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 Dijkstras Algorithm See Also bellman_ford_algorithm, dag_shortest_path SeqAn - Sequence Analysis Library - www.seqan.de