数据结构---图（求关节点）

// Find Articulation Point.cpp : Defines the entry point for the console application.
/*-----CODE FOR FUN---------------
-------CREATED BY Dream_Whui------
-------2015-2-13--------------------*/

#include "stdafx.h"
#include "graph.h"

int COUNT;
int low[MAX_VERTEX_NUM];

void DFSArticul(ALGraph G, int v0)//从第v0个顶点出发深度优先遍历图G，查找并输出 关节点
{
    int w,min;
    visited[v0] = min = ++COUNT;//v0是第count个访问的顶点
    ArcNode *p;
    for(p=G.vertices[v0].firstarc; p!=NULL; p=p->nextarc)//对v0的每个邻接顶点检查
    {
        w = p->adjvex;        //w为V0的邻接顶点
        if(visited[w] == 0)    //w未曾访问，是v0的孩子
        {
            DFSArticul(G,w);//返回前求得low[w]
            if(low[w] < min)
                min = low[w];
            if(low[w] >= visited[v0])
                cout<<v0<<" "<<G.vertices[v0].data<<endl;
        }
        else
            if(visited[w] <