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 critical to keeping part of the graph connected.
6 resources across 2 libraries
Glossary Terms(5)
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…
Eulerian Path
An Eulerian path is a walk through a graph that visits every edge exactly once, and an Eulerian circuit is an Eulerian path that additionally starts and ends a…