leetcode Ch7-Graph Search

void bfsTraverse(Graph* g) {
queue<int> q;
for (int i = 0; i < numVertex; i++) {
if (!visited[i]) {
visited[i] = 1;
print(g, i);
q.push(i);
while (!q.empty()) {
int j = q.top();
q.pop();
EdgeNode* p = g->vexs[j].next;
while (p) {
if (!visited[p->index]) {
visited[p->index] = 1;
print(g, p->index);
q.push(p->index);
}
p = p->next;
}
}
}
}
}