#include <bits/stdc++.h>
using namespace std;

char data[] = {'A', 'B', 'C', 'D'};
const int N = 4;

int g[N][N];
/*
int g[N][N] = {
    {0, 1, 0, 1},
    {1, 0, 1, 1},
    {0, 1, 0, 1},
    {1, 1, 1, 0}
};
*/

// 无向图 双向边 
void addEdge(int u, int v) // u、v都是顶点编号 
{
    g[u][v] = g[v][u] = 1;
}

bool vis[N];
void dfs(int u)
{
    cout << data[u] << ' ';
    vis[u] = true;

    for (int j = 0; j < N; j ++)
    {
        if (g[u][j] == 1 && !vis[j])
            dfs(j);
    }
}

bool inq[N];
void bfs(int u)
{
    queue<int> q;
    q.push(u);
    inq[u] = true;

    while (!q.empty())
    {
        int u1 = q.front();
        q.pop();
        cout << data[u1] << ' ';
        for (int j = 0; j < N; j ++)
        {
            if (g[u1][j] == 1 && !inq[j])
            {
                q.push(j);
                inq[j] = true;
            }
        }

    }
}

int main()
{
    // 构建好图 
    addEdge(0, 1);
    // addEdge(0, 2);
    addEdge(0, 3);

    // addEdge(1, 0); 不需要重复设置
    addEdge(1, 2);
    addEdge(1, 3);

    addEdge(2, 3); 

    for (int i = 0; i < N; i ++)
    {
        for (int j = 0; j < N; j ++)
            cout << g[i][j] << ' ';
        cout << endl; 
    }

    dfs(0); // A B C D

    cout << endl;
    memset(vis, 0x00, sizeof(vis));
    dfs(1); //B A D C

    cout << endl;
    bfs(0); // A B D C

    cout << endl;
    memset(inq, 0x00, sizeof(inq));
    bfs(1); // B A C D

    return 0;
} 

#include <bits/stdc++.h>
using namespace std;

char data[] = {'A', 'B', 'C', 'D'};

vector<int> g[4]; // 邻接表实现 

void dfs(int u)
{

}

void bfs(int u)
{

}

int main()
{

    // 构建图 
    g[0].push_back(1);
    g[0].push_back(3);

    g[1].push_back(0);
    g[1].push_back(2);
    g[1].push_back(3);

    g[2].push_back(1);
    g[2].push_back(3);

    g[3].push_back(0);
    g[3].push_back(1);
    g[3].push_back(2);

    // 打印邻接表 
    for (int i = 0; i < 4; i ++)
    {
        // g[i]
        cout << i << "->";
        for (int j = 0; j < g[i].size(); j ++)
            cout << g[i][j] << ' ';
        cout << endl;
    }

    return 0;
}