图-深度优先DFS

bool visited[MaxVertexNum];//访问标记数组

void DFS(Graph G,int v)//从v出发，深度优先图G
{
    visit(v);
    visited[v] = true;
    for(w = FirstNeighbor(G,v);w>=0;w = NextNeighbor(G,v,w))
        if(!visited[w])
        {
            DFS(G,w);
        }
}
void DFSTraverse(Graph G)
{
    for(int v = 0;v<G.vexnum;v++)//初始化标记数组
        visited[v] = false;
    for(int v = 0;v<G.vexnum;v++)//从v = 0开始遍历
        if(!visited[v])
            DFS(G,v);
}