图的深度、广度优先遍历

/*---------------------------------------------------------------------------------------------------*/ /*图的深度优先遍历搜索递归算法。g为存储图的邻接表，i为遍历的初始顶点编号， */ void dfs(ALGraph *g,int i) { ArcNode *p = NULL; printf("%d\t", g -> adjlist[i].data); visited[i] = 1; p = g -> adjlist[i].firstarc; while( p != NULL) { if(visited[p -> adjvex] == 0) { dfs(g, p-> adjvex); } p = p -> nextarc; } }