dsa2 min read
Advanced Graphs — Complete Guide (MST, SCC, Bridges, Floyd-Warshall, A*)
Master advanced graph algorithms: Kruskal and Prim MST, Tarjan SCC, articulation points, bridges, Floyd-Warshall all-pairs shortest path, and A* search.
Read →
Bridges
4 articles
dsa2 min read
Bridges and Articulation Points — Graph Vulnerability Detection
Find all bridge edges and articulation point vertices in an undirected graph using a single DFS pass with discovery time and low-link tracking.
Read →
dsa2 min read
Find Critical Connections in Network — Bridge Finding
LeetCode 1192: Find all critical edges (bridges) in a network. A connection is critical if removing it disconnects the network. Uses Tarjan's bridge algorithm.
Read →
dsa3 min read
Advanced Graphs — Master Recap and Algorithm Selection Guide
Complete recap of all 20 advanced graph problems with algorithm selection guide, complexity comparison, and pattern recognition cues.
Read →