LeetcodeGraphs
Graph Traversal: BFS vs DFS Step by Step
Step through BFS and DFS on graphs visually. Compare queue vs stack, see the visited set in action, with interactive simulator and Python code.
12 min read
Loading...
Back to all posts
Category
Graphs
Navigate networks and find shortest paths
8 posts
LeetcodeGraphs
Topo Sort: How npm Decides What Runs First
Master topological sort with Kahn's algorithm and DFS. Interactive simulator lets you build DAGs and watch in-degrees drop to zero step by step.
14 min read
LeetcodeGraphs
Dijkstra's Algorithm: Shortest Paths Step by Step
Step through Dijkstra's algorithm visually. See how a min-heap and edge relaxation find shortest paths, with interactive simulator and Python code.
12 min read
LeetcodeGraphs
Union-Find: The 20-Line O(1) Trick
Master Union-Find with path compression and union by rank. Interactive playground lets you merge sets and watch trees flatten in real time.
14 min read
LeetcodeGraphs
How AWS Connects 33 Regions: Kruskal's Algorithm
See how AWS-style networks find the cheapest way to connect every region. Interactive visualizer, Python walkthrough, and pattern recognition guide.
14 min read
LeetcodeGraphs
Prim's Algorithm: MST Step by Step
Step through Prim's algorithm visually. See how a min-heap grows the minimum spanning tree, with interactive simulator and Python code.
12 min read
LeetcodeGraphs
Netflix Recommendation Loops: Tarjan's Algorithm
How Tarjan's algorithm finds recommendation loops in directed graphs. Netflix-style example, interactive visualizer, Python benchmarks.
14 min read
LeetcodeGraphs
How Does Google Maps Skip 90% of Roads?
See how graph algorithms let Google Maps skip 96% of roads. Benchmark with 40K intersections, full Python code, and interactive simulator.
14 min read