深度优先遍历(Depth-First Traversal)

static void dfs_traverse(algraph* g)
{
        int i;

        for(i = 0; i < g->nodes; i++){
                visited[i] = 0;
        }

        for(i = 0; i < g->nodes; i++){
                if(!visited[i]){
                        dfs(g, i);
                }
        }
        printf("\n");
}

static void dfs(algraph* g, int i)
{
        edgenode* p;

        visited[g->adjlist[i].vertex] = 1;
        printf("%d ", g->adjlist[i].vertex);

        p = g->adjlist[i].firstedge;
        for(p; p != NULL; p = p->next){
                if(!visited[p->adjvex]){
                        dfs(g, p->adjvex);
                }
        }
}