Shortest Path Algos

Question 1

What is Dijkstra’s algorithm used for?

Answer 1

Finds shortest path in weighted graphs (O(V + E log V)).

Question 2

What is the Bellman-Ford algorithm, and how does it differ from Dijkstra’s?

Answer 2

Bellman-Ford works with negative weights.

Question 3

What is Floyd-Warshall used for?

Answer 3

Finds shortest paths between all nodes (O(n³)).