cheet 6 深搜和广搜

// 深搜 | // 广搜 
-------------------------------------|--------------------------------------
void DFSTraverse(Graph G)            | void BFSTraverse(Graph G) 
{                                    | { 
    for(int v = 0; v < G.vexnum; v++)| for(int v = 0; v < G.vexnum; v++)
        visit[v] = false;            | visit[v] = false; 
                                     | 
    for(int v = 0; v < G.vexnum; v++)| for(int v = 0; v < G.vexnum; v++)
        if(!visit[v])                | if(!visit[v]) 
            DFS(G, v);               | BFS(G, v); 
}                                    | } 
-------------------------------------|--------------------------------------
                                     | 
void DFS(Graph G)                    | void BFS(Graph G, int v) 
{                                    | { 
    visit[v] = true;                 | InitQueue(Q); 
    Visit(v);                        | visit[v] = true; 
                                     | Visit(v); 
    for(int w)                       | EnQueue(Q, v); 
        if(!visit[w])                | 
            DFS(G, w);               | while(!QueueEmpty(Q)) 
}                                    | { 
                                     | DeQueue(Q, u); 
                                     | for(int w) 
                                     | if(!visit[w]) 
                                     | { 
                                     | visit[w] = true;
                                     | Visit(w);
                                     | EnQueue(Q, w);
                                     | }
                                     | }
                                     | }