Shortest Path (Directed Graphs)
The shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of the edges along the path is minimized.
AWD
Arbitrary Weight, Directed
5 Algorithms
| Nonnegative Weights | 7 | Nonnegative Weight |
| General Weights, Undirected | 6 | Arbitrary Weight |
- General Weights
- NWDNonnegative Weight, Directed
7 Algorithms
Nonnegative Integer Weights 4 Nonnegative Integer Weight Nonnegative Weights, Undirected 2 Nonnegative Weight Undirected, Nonnegative Weights 1 Nonnegative Weight - Nonnegative Weights
- NIWNonnegative Integer Weight, Directed
4 Algorithms
- NWUNonnegative Weight, Undirected
2 Algorithms
- NWUNonnegative Weight, Undirected
1 Algorithms
- AWUArbitrary Weight, Undirected
6 Algorithms
NWD
Nonnegative Weight, Directed
2 Algorithms
WD
Weighted Digraph
1 Algorithms