Bridges (low-link DFS): Examples & Code
Bridges (low-link DFS): Treat each input edge as undirected. Skip only the parent edge, preserving parallel edges; compare discovery times and low links.…
Explore algorithm visualizations code snippets and tutorials
Bridges (low-link DFS): Treat each input edge as undirected. Skip only the parent edge, preserving parallel edges; compare discovery times and low links.…
Kosaraju strongly connected components: Finish a DFS forest, then explore reversed edges in decreasing finish order. Explore a worked example, complexity and…
Tarjan strongly connected components: Track discovery times, low links and an active stack; pop one strongly connected component at each root. Explore a…
Bidirectional breadth-first search: Expand complete BFS layers from node 0 and from the highest node on reversed edges. Weights are ignored. Explore a worked…
Stable marriage (Gale–Shapley): Proposers make offers in preference order; receivers retain their preferred offer. Complete strict lists produce a…