The QuickGraph.Algorithms.ShortestPath namespace contains algorithms for solving shortest path problems.
Graph with positive edge weight should use the DijkstraShortestPathAlgorithm.
If all the wieghts are equal to 1, the BreadthFirstSearchAlgorithm is more efficient to use.
If the weights can be negavite, use the BellmanFordShortestPathAlgorithm.
Classes
| Class | Description | |
|---|---|---|
 | BellmanFordShortestPathAlgorithm |
Bellman Ford shortest path algorithm.
|
| DagShortestPathAlgorithm |
Directed Acyclic Graph single source shortest path algorithm.
|
| DijkstraShortestPathAlgorithm |
Dijkstra shortest path algorithm.
|
