采用邻接表表示图的DFS

 数据结构第二版严蔚敏  

void DFS(ALGraph g, int v){
	printf("%d", v);
	visited[v] = true;
	ArcNode *p = new ArcNode;
	p = g.vertice[v].firstarc;
	while(p!=NULL){
		int w = p->adjvex;
		if( !visited[w] ){
			DFS(g, w);
		}
		p = p->nextArc;
	}
}