Concepts5

Bidirectional BFS searches forward from the start and backward from the goal to meet in the middle, drastically reducing explored states.

Floyd–Warshall computes the shortest distances between all pairs of vertices in O(n^3) time using dynamic programming.

Dijkstra's algorithm finds shortest path distances from one source to all vertices when all edge weights are non-negative.

Bellman–Ford finds single-source shortest paths even when some edge weights are negative.

0-1 BFS is a shortest path algorithm specialized for graphs whose edge weights are only 0 or 1.