关节点

#include<iostream>


using namespace std;


#define MAXN 100




int matrix[MAXN][MAXN];
int visited[MAXN];
int low[MAXN];
int index;
int n;


void DFS(int v)
{
int min;
visited[v] = min = ++index;
for(int i = 0; i < n; i++)
{
if(matrix[v][i])
{
if(!visited[i])
{
DFS(i);
if(low[i] < min) min = low[i];
if(low[i] >= visited[v])
{
cout<< v <<endl;
}
}
else
{
if(visited[i] < min)
min = visited[i];
}
}
}
low[v] = min;
}


void Solve(int v)
{
index = 0;
visited[v] = ++index;
bool bJudged = false;
for(int i = 0; i < n; i++)
{
if(matrix[v][i])
{
DFS(i);
if(!bJudged)
{
bJudged = true;
if(index < n)
{
cout<< v << endl;
}
}
}
}

}


void Set(int i, int j, int value)
{
matrix[i][j] = value;
matrix[j][i] = value;
}


int main()
{
n = 4;
memset(matrix, 0, sizeof(matrix));
memset(visited, 0, sizeof(visited));
memset(low, 0, sizeof(low));


Set(0, 1, 1);
Set(1, 2, 1);
Set(1, 3, 1);


Solve(0);


system("pause");
return 0;
}