Collection of classes that compute the All-Shortest path problem.
Classes
| Class | Description | |
|---|---|---|
 | FloydWarshallAllShortestPathAlgorithm |
Floyd Warshall All Shortest Path Algorithm
|
| FloydWarshallEventArgs |
Delegates
| Delegate | Description | |
|---|---|---|
 | FloydWarshallEventHandler |
Remarks
An all-shortest path algorithm computes all the shortest path between all the graph vertices.
The FloydWarshallAllShortestPathAlgorithm runs in O(V^3). It can also be used to compute other quantities: transitive hull, safest path, min-max path, etc. Those are trigerred by IFloydWarshallDistanceReducer classes.
