MCC Class - Graph

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

#define MAXN 100

vector<int> adj[MAXN];
bool vis[MAXN];
int parent[MAXN];
int dist[MAXN];
int N, E;

int color[MAXN];

bool hasCycle = false;
bool isBipartite = true;

void init()
{
    for (int i = 0; i < MAXN; i++)
        adj[i].clear();
    memset(vis, false, sizeof(vis));
    memset(parent, -1, sizeof(parent));
    memset(dist, 0, sizeof(dist));
    memset(color, 0, sizeof(color));
    hasCycle = false;
    isBipartite = true;
}

void dfs(int u)
{
    vis[u] = true;
    cout << u << ' ';
    for (int i = 0; i < adj[u].size(); i++)
    {
        int v = adj[u][i];
        if(vis[v] == false)
        {
            parent[v] = u;
            color[v] = !color[u];
            dfs(v);
        }
        else
        {
            if(parent[u] != v)
                hasCycle = true;
            if(color[u] == color[v])
                isBipartite = false;
        }
    }
}

void bfs(int src)
{
    queue<int> Q;

    dist[src] = 0;
    vis[src] = true;
    parent[src] = -1;
    Q.push(src);

    while(Q.empty() == false)
    {
        int u = Q.front();
        Q.pop();

        for (int i = 0; i < adj[u].size(); i++)
        {
            int v = adj[u][i];
            if(vis[v] == false)
            {
                dist[v] = dist[u] + 1;
                vis[v] = true;
                parent[v] = u;
                Q.push(v);
            }
        }
    }
}

int main()
{
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);

    init();

    cin >> N >> E;
    for (int i = 0; i < E; i++)
    {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    for (int i = 0; i < N; i++)
    {
        cout << i << ": ";
        for (int j = 0; j < adj[i].size(); j++)
        {
            cout << adj[i][j] << " ";
        }
        cout << endl;
    }

    int src = 0;

    // bfs(src);


    // cout << "Distance: \n";
    // for (int i = 0; i < N; i++)
    // {
    //     cout << i << ": " << dist[i] << endl;
    // }
    color[src] = 0;

    dfs(src);

    if(isBipartite == true)
        cout << "\nBipartite\n";
    if(hasCycle)
        cout << "Cycle\n";

    return 0;
}

/*

adj[0] -> vector {...}
adj[1] -> vector {...}
.
.
.
adj[MAXN-1] -> vector {...}


vis {0 0 0 0 0 0 0}

memset -> 0, 1, -1



INPUT:
6 7
0 1
1 2
3 5
2 3
3 4
0 3
2 1


*/