Graph Theory: Shortest Path Algorithms
No difference between shortest paths in directed and undirected graphs (undirected graph are special cases of directed graphs)
Graph storage: dense graphs (adjacency matrix) && sparse graphs (adjacency list)
I. Single-Source Shortest Path
1. All edge weights are positive - Dijkstra's Algorithm
Handling multiple edges and self-loops
...
Posted on Sat, 20 Jun 2026 17:06:21 +0000 by PHP Newb