图论-BFS-邻接矩阵

#include
using namespace std;

#define INF 100000
#define maxn 6

int G[maxn][maxn];  //邻接矩阵
bool vis[maxn];         //访问标记数组
vector res;         //存储访问结果

//遍历u所在的连通块
void BFS(int u)
{
    queue que;
    que.push(u);
    vis[u] = true;

    while(!que.empty())
    {
        int u = que.front();
        que.pop();
        res.push_back(u);

        for(int i=0; i>a>>b;
        G[a][b] = 1;
    }
}

int main()
{
    freopen("in.txt","r",stdin);
    inputG(9);
    BFSTraversal(0);
    for(int i:res)
    {
        cout<