Articulation Points & Bridges in Graphs
Find critical vertices and edges whose removal disconnects the graph using DFS-based algorithms.
Posts tagged with #graph-algorithms
Bellman-Ford Algorithm: Shortest Paths with Negative Weights
Learn the Bellman-Ford algorithm for single-source shortest paths including negative edge weights and negative cycle detection.
Depth-Limited & Bidirectional Search
Explore search algorithm variants: depth-limited search for bounded recursion, and bidirectional search for O(b^d/2) complexity improvement.
Depth-Limited Search: Bounded Depth-First Search
Learn depth-limited search (DLS) for handling infinite state spaces with a depth bound, and how it relates to iterative deepening.
Dijkstra's Algorithm: Finding Shortest Paths in Weighted Graphs
Master Dijkstra's algorithm for single-source shortest path problems in weighted graphs with positive edges, including implementations and trade-offs.
Floyd-Warshall Algorithm: All-Pairs Shortest Paths
Master the Floyd-Warshall algorithm for finding shortest paths between all pairs of vertices in weighted graphs, with implementation examples and trade-offs.
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.
Kruskal's Algorithm: Building Minimum Spanning Trees
Learn Kruskal's algorithm for finding minimum spanning trees in weighted graphs using union-find data structures.
Prim's Algorithm: Growing a Minimum Spanning Tree
Learn Prim's algorithm for finding minimum spanning trees starting from a vertex, using a greedy approach with priority queues.
Tarjan's Strongly Connected Components
Find strongly connected components in directed graphs using DFS-based Tarjan's algorithm with lowlink values.