Function
bellman_ford_algorithm
Computes shortest paths from a single source in a graph.
bellman_ford_algorithm(g, source, weight, predecessor, distance)
Parameters
g
In-parameter:A graph.
Types: Graph
source
In-parameter:A source vertex.
weight
In-parameter:A weight map.
Remarks: A property map with edge weights. Edge weights may be negative.
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
True if the graph has no negative weight cycles, false otherwise.
Remarks
Edge weights may be negative in the Bellman-Ford algorithm. The out parameters are only valid if the algorithm returns true.
Example Programs
SeqAn - Sequence Analysis Library - www.seqan.de