Bellman Ford shortest path algorithm.
Namespace:
QuickGraph.Algorithms.ShortestPathAssembly: QuickGraph.Algorithms (in QuickGraph.Algorithms.dll) Version: 2.4.2.1407 (2.4.2.1407)
Syntax
| C# |
|---|
public class BellmanFordShortestPathAlgorithm |
| Visual Basic (Declaration) |
|---|
Public Class BellmanFordShortestPathAlgorithm |
Remarks
The Bellman-Ford algorithm solves the single-source shortest paths problem for a graph with both positive and negative edge weights.
If you only need to solve the shortest paths problem for positive edge weights, Dijkstra's algorithm provides a more efficient alternative.
If all the edge weights are all equal to one then breadth-first search provides an even more efficient alternative.
