图的广度优先

void BFT(vector<vector<int>>G, int n)//G是图，n是点的个数{vector<bool>visit(n);deque<int>Q;for (int i = 0; i < n; i++){if (!visit[i]){visit[i] = true;cout << i+1;Q.push_back(i);while (!Q.empty()){int temp = Q.front();Q.pop_front();for (int j = 0; j < n; j++){if (G[temp][j] == 1 && !visit[j]){visit[j] = true;cout << j+1;Q.push_back(j);}}}}}}