Articulation Points & Bridges in Graphs
Find critical vertices and edges whose removal disconnects the graph using DFS-based algorithms.
Posts tagged with #dfs
DP on Trees and Graphs: Tree DP and Graph DP
Apply dynamic programming to tree and graph structures using DFS-based state propagation for optimal subtree and path calculations.
Graphs: Adjacency List, Matrix, and Core Algorithms
Master graph representations (adjacency list and matrix), BFS, DFS, and when to use each representation.
Kosaraju's Algorithm for Strongly Connected Components
Find strongly connected components using the two-pass Kosaraju's algorithm with graph transpose and DFS finishing times.
Tarjan's Strongly Connected Components
Find strongly connected components in directed graphs using DFS-based Tarjan's algorithm with lowlink values.