利用深度优先搜索求连通图G的所有关节点(共3页).doc

精选优质文档-倾情为你奉上#includeusing namespace std;#define MAX 50int LowMAX,dMAX;typedef struct ENode/定义结点 int AdjVex;/该弧所指向的的顶点位置struct ENode *NextArc;/指向下一条弧的指针int info; ArcNodeMAX;typedef structArcNode vertices;/邻接表int vexnum,arcnum;/顶点数和边数 ALGraph;ALGraph G=*(ALGraph *)malloc(sizeof(ALGraph);void DFS(int u,int p)/p为根节点static int time=0;int v;Lowu=du=time+;for(ENode *w=&(G.verticesu);w;w=w-NextArc