Graph Connectivity Analysis Using Tarjan's Algorithm
Analyzing Graph Connectiivty Through Node Removal
When removing a node from a graph, we need to calculate the impact on connectivity. Each removal can create multiple connected components, requiring careful tracking of these new components.
Key Concepts
Articulation Points: Nodes whose removal increases the number of connected components
Compo ...
Posted on Thu, 01 Oct 2026 16:26:30 +0000 by Tekron-X
Strongly Connected Components in Directed Graphs
Graph Connectivity Concepts
A connected component in an undirected graph is a maximal subgraph where every pair of vertices is connected via a path. For directed graphs, a strongly connected component (SCC) is a maximal subgraph where every pair of vertices is mutually reachable via directed paths. SCCs are unique to directed graphs.
In DFS tre ...
Posted on Wed, 23 Sep 2026 16:54:45 +0000 by TapeGun007
Competitive Programming Template Collection
Tarjan's Algorithm for Strongly Connnected Components
namespace TarjanSCC {
int dfn[N], low[N], index, colorCount;
int comp[N], size[N], value[N];
bool inStack[N];
stack<int> stk;
vector<int> graph[N];
void tarjan(int u) {
dfn[u] = low[u] = ++index;
stk.push(u);
inStack[u] = true;
...
Posted on Tue, 02 Jun 2026 18:01:50 +0000 by justgrafx