·4 min read
Read Shortest Path Algorithms, when to Use What?Shortest Path Algorithms, when to Use What?
I often struggled with one thing while solving graph problems, not the implementation, but the decision. Which algorithm should I use here? BFS? Dijkstra? Bellman-Ford? Floyd-Warshall?