Graph Adjacency List

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

void addedge(vector<int>adj[], int n1, int n2)
{
    adj[n1].push_back(n2);
    adj[n2].push_back(n1);
}

void printgraph(vector<int>adj[], int node)
{
    cout << "\nAdjacency List is :: \n";
    for(int i=0;i<node;i++)
    {
        cout << "Node " << i << " to Connected :: ";
        for(int j=0;j<adj[i].size();j++)
        {
            cout << adj[i][j] << " ";
        }
        cout << "\n";
    }
}

int main()
{
    int node, edge, n1, n2, i, j;

    cout << "Enter Node And Edge :: ";
    cin >> node >> edge;

    vector<int> adj[node];

    cout << "\nEnter Edges :: \n";
    for(i=1;i<=edge;i++)
    {
        cin >> n1 >> n2;
        addedge(adj, n1, n2);
    }

    printgraph(adj, node);

    return 0;
}