Strongly Connected Components
Strongly connected components (SCCs) are maximal subsets of vertices in a directed graph such that every vertex in the subset is reachable from every other vertex in that same subset via directed edges.
10 resources across 2 libraries
Glossary Terms(7)
Bellman-Ford Algorithm
The Bellman-Ford algorithm is a graph algorithm that computes the shortest paths from a single source vertex to all other vertices in a weighted graph, correct…
Floyd-Warshall Algorithm
The Floyd-Warshall algorithm is a dynamic-programming algorithm that computes the shortest paths between all pairs of vertices in a weighted graph, including g…
Topological Sorting
Topological sorting is an algorithmic technique that produces a linear ordering of the vertices of a directed acyclic graph (DAG) such that for every directed…
Strongly Connected Components
Strongly connected components (SCCs) are maximal subsets of vertices in a directed graph such that every vertex in the subset is reachable from every other ver…
Articulation Points
An articulation point (or cut vertex) is a vertex in an undirected graph whose removal increases the number of connected components, meaning the vertex is crit…
Bridges in Graph
A bridge (or cut edge) is an edge in an undirected graph whose removal increases the number of connected components, meaning the edge is the only connection be…
Hamiltonian Path
A Hamiltonian path is a path through a graph that visits every vertex exactly once, and a Hamiltonian cycle is a Hamiltonian path that additionally returns to…
Interview Questions(3)
What is Kosaraju's Algorithm?
Kosaraju's algorithm finds all strongly connected components (SCCs) of a directed graph in O(V + E) time using two depth-first search passes: one on the origin…
What is Tarjan's Algorithm?
Tarjan's algorithm finds all strongly connected components (SCCs) of a directed graph in a single O(V + E) DFS pass by tracking each vertex's discovery time an…
What are Strongly Connected Components?
A strongly connected component (SCC) is a maximal set of vertices in a directed graph where every vertex can reach every other vertex in the set via a directed…