int main(int argc, char const *argv[]) { Queue *q = createQueue(); for (int i = 0; i < MAX_SIZE; ++i) { addQ(q, i); } for (int i = 0; i < MAX_SIZE; ++i) { deleteQ(q); } return 0; }
void BFS(int v) { node *p; visited[v]=1; printf(" %d",v); front=rear=-1; addQ(v); while(!isQempty()) //while q not empty { v=delQ(); p=arr_ptr[v]; while(p!=NULL) { if(!visited[p->vertex]) { addQ(p->vertex); visited[p->vertex]=1; printf(" %d",p->vertex); } p=p->next; } } }