🕸️ Graph Algorithms

Complete implementations of 10 essential graph algorithms with theory, visualization, PHP code, and interview questions.

Level-order traversal using Queue. Shortest path in unweighted graphs.

Depth-first traversal using Stack/Recursion. Cycle detection, paths.

Single-source shortest path for non-negative weights. GPS navigation.

Handles negative weights. Can detect negative cycles.

All-pairs shortest paths. O(V³) dynamic programming approach.

Minimum Spanning Tree using priority queue. Network design.

MST using Union-Find. Sort edges, add if no cycle.

Linear ordering of DAG vertices. Task scheduling.

Disjoint Set Union with path compression. Nearly O(1).

Detect cycles in directed and undirected graphs.