finding strongly connected components (tarjan's)

findStronglyConnectedComponents.cpp

int curComp = 1, curNum = 1;
int comp[MAX_N], num[MAX_N] = { };
int low[MAX_N], stack[MAX_N], front = 0;

void findStronglyConnectedComponents(int v)
{
	num[v] = low[v] = curNum;
	curNum++;
	stack[front] = v;
	front++;
	comp[v] = -1;

	for(int i = 1; i <= N; i++)
	{
		if(e[v][i])
		{
			if(num[i] == 0)
			{
				findStronglyConnectedComponents(i);
				low[v] = min(low[v], low[i]);
			}
			else if(comp[i] == -1)
			{
				low[v] = min(low[v], low[i]);
			}
		}
	}

	if(low[v] == num[v])
	{
		do
		{
			front--;
			int i = stack[front];
			comp[i] = curComp;
		} while(stack[front] != v);
		
		curComp++;
	}
}