greyflame的博客

原创 由邻接表构建的无向图输出给定顶点的简单回路

函数实现： int pathnum = 0; int path[MaxSize]; int j = 0; int start; void findcircle(ALGraph* G, int v1) { EdgeNode* p; if(pathnum == 0) start = v1; int nextadj; path[j++] = v1; visited[v1] = 1; p = G->adjlist[v1].firstarc; ...