Tarjan模板

Tarjan模板。

预处理：

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;

#define MAXN 50010
#define MAXM 100010

struct Edge
{
    int v, next;
    int id; // for(int i = 1; i <= n; i++) id = i;
}edge[MAXM];

int first[MAXN], stack[MAXN], ins[MAXN], dfn[MAXN], low[MAXN];
int belong[MAXM], ind[MAXN];
int ind[MAXN], outd[MAXN]; 

int n, m;
int cnt;
int scnt, top, tot, nbridge;
int leaf;
void init()
{
    cnt = 0;
    scnt = top = tot = nbridge = 0;
    leaf = 0;
    memset(first, -1, sizeof(first));
    memset(dfn, 0, sizeof(dfn));
    memset(ins, 0, sizeof(ins));
    memset(ind, 0, sizeof(ind));
}

强连通分量：

/*强连通分量*/

void dfs(int u)
{
	int v;
	low[u] = dfn[u] = ++tot;
	stack[top++] = u;
	ins[u] = 1;
	for(int e = first[u]; e != -1; e = edge[e].next)
	{
		v = edge[e].v;
		if(!dfn[v])
		{
			dfs(v);
			low[u] = min(low[u], low[v]);
		}
		else if(ins[v])
		{
			low[u] = min(low[u], dfn[v]);
		}
	}
	if(low[u] == dfn[u])
	{
		scnt++;
		do
		{
			v = stack[--top];
			belong[v] = scnt;
			ins[v] = 0;
		}while(u != v);
	}
}

void Tarjan()
{
	for(int v = 1; v <= n; v++) if(!dfn[v])
		dfs(v);
}

双连通分量+判重边：

/*双连通分量*/

void Tarjan(int u, int fa)
{
	int v;
	low[u] = dfn[u] = ++tot;
	ins[u] = 1;
	stack[top++] = u;
	bool repeat = 0;
	for(int e = first[u]; e != -1; e = edge[e].next)
	{
		v = edge[e].v;
		if(v == fa && !repeat) continue;
		if(!dfn[v])
		{
			Tarjan(v, u);
			low[u] = min(low[u], low[v]);
		}
		else if(ins[v])
		{
			low[u] = min(low[u], dfn[v]);
		}
	}
	if(low[u] == dfn[u])
	{
		scnt++;
		do
		{
			v = stack[--top];
			belong[v] = scnt;
			ins[v] = 0;
		}while(u != v);
	}
}

 

割边+判重边：

/*割边*/

int bridge[MAXM];
int nbridge = 0;

inline int check(int u, int fa)
{
	int count = 0;
	for(int e = first[u]; e != -1; e = edge[e].next)
	{
		int v = edge[e].v;
		if(v == fa) count++;
	}
	if(count >= 2) return 1;
	return 0;
}

inline void Tarjan(int u, int fa)
{
	low[u] = dfn[u] = ++tot;
	bool repeat = 0; //repeat = check(u, fa);
	for(int e = first[u]; e != -1; e = edge[e].next)
	{
		v = edge[e].v;
		if(v == fa && !repeat) //去掉一条反向边，其余可能是重边。
		{
			repeat = 1; //调用check函数之后直接continue 
			continue;
		}
		if(!dfn[v])
		{
			Tarjan(v, u);
			low[u] = min(low[u], low[v]);
			if(dfn[u] < low[v]) bridge[nbridge++] = edge[e].id;
		}
		low[u] = min(low[u], dfn[v]);
	}
}

割顶：

/*割顶*/
inline void Tarjan(int u, int fa)
{
    int rootson = 0; //根节点的儿子节点数目，如果大于1，则根节点是割点
    low[u] = dfn[u] = ++tot;//标记次序的节点编号一定要从1开始
    for(int e = first[u]; e != -1; e = edge[e].next)  
    {  
        int v = edge[e].v;  
        if(!dfn[v])  
        {  
            if(u == root) //根的情况要特殊处理,j不可能等于root，j是u的子节点   
            {  
                if(++rootson > 1) sub[u]++;  
            }
            Tarjan(v, u); //u是v的父节点
            low[u] = min(low[u], low[v]); //low值是更新当前的父节点，利用儿子节点的low来更新   
            if(u != root && dfn[u] <= low[v]) //根的情况已经讨论，避免重复 
                sub[u]++; //都是对目前传入的父亲节点进行讨论，不能置其子节点为true.   
        }
        low[u] = min(low[u], dfn[v]);  
    }  
}

inline void solve()
{
    int flag = 0;
    for(int i = 1; i <= n; i++) sub[i] = 1;
    Tarjan(root, -1);
    for(int i = 1; i <= n; i++)
    {
        if(sub[i] > 1)
        {
            flag = 1;
            printf("  SPF node %d leaves %d subnets\n", i, sub[i]);
        }
    }
    if(!flag) printf("  No SPF nodes\n");
}




/*预处理根节点为0，其余为1，只要sub[u] > 1，u为割顶*/
inline void Tarjan(int u)
{
	low[u] = dfn[u] = ++tot;
	for(int e = first[u]; e != -1; e = edge[e].next)
	{
		v = edge[e].v;
		if(!dfn[v])
		{
			Tarjan(v);
			low[u] = min(low[u], low[v]);
			if(dfn[u] <= low[v]) sub[u]++;
		}
		low[u] = min(low[u], dfn[v]);
	}
}