Shortest Path
← Back to Graph Algorithms
Algorithms for finding the path with minimum total weight between vertices in a graph. Shortest path problems are fundamental in routing, navigation, and network optimization.
Key Properties
Related
- Traversal (BFS gives shortest path in unweighted graphs)