Algorithms

Single-Source Shortest Path Algorithms

Find cheapest routes in weighted graphs: Dijkstra's greedy heap-based search, Bellman–Ford's relax-everything approach that tolerates negative edges, and the all-pairs duo — Warshall's transitive closure and Floyd's Θ(V³) distance matrix.

Topics

Dijkstra's Algorithm

Bellman–Ford Algorithm

All-Pairs: Warshall's Algorithm (Transitive Closure)

All-Pairs: Floyd's Algorithm