图的遍历

void dfs(Graph G,int i) 
{
    visted[i] = 1;
    for (int j = 0; i < G.vex; j++)
    {
        if (G.arcs[i][j]==1&&visted[j]!=1)
        {
            dfs(j);
        }
    }

}

void  bfs(Graph G,int i) 
{
    int e = 0;
    Queue q = createQueue();
    visted[i] = 1;
    enQueue(q, i);
    while (isEmpty(q))
    {
        e = deQueue(q);
        for (int j = 0; j < G.vexnum; j++)
        {
            if (G.arcs[e][j] == 1 && visted[j] != 1) 
            {
                visted[j] = 1;
                enQueue(q, j);
            }
        }
    }
}