void dfstraverse(Graph *g)

{

int i;

for(i=1;i<=g->vexnum;i++)

visited[i]=0;

for(i=1;i<=g->vexnum;i++)

if(!visited[i])

{dfs(g,i);}

}

typedef struct{

int V[M];

int front;

int rear;

}Queue;

initqueue(Queue *q)

{

q->front=0;

q->rear=0;

}

int quempty(Queue *q)

{

if(q->front==q->rear)

{

return 0;

}

else

{

return 1;

}

}

enqueue(Queue *q,int e)

{

if((q->rear+1)%M==q->front)

{

printf("The queue is overflow!\n");

return 0;

}

else

{

q->V[q->rear]=e;

q->rear=(q->rear+1)%M;

return 1;

}

}