typedefstructQue_T{
inthead;
intrear;
intsize;
Graph_S*que[10000];
}Que_S;
Que_Sg_que;
voidQueInit(){
g_que.head=0;
g_que.rear=0;
g_que.size=10000;
}
boolQueIsEmpty(){
return(g_que.head==g_que.rear);
}
int QueCounter(){
    return (g_que.rear + g_que.size - g_que.head) % g_que.size;
}
voidQuePush(Graph_S*val){
g_que.que[g_que.rear]=val;
g_que.rear=(g_que.rear+1)%g_que.size;
}
Graph_S*QuePop(){
Graph_S*node=g_que.que[g_que.head];
g_que.head=(g_que.head+1)%g_que.size;
returnnode;
}