Code (Adjacency List)

#include <iostream>
#include <vector>

#include<algorithm>
using namespace std;

int main()
{
    //Code (Adjacency Mat.)
    int V,E;
    cout << "Vertex :";
    cin >> V  ;

    vector<pair<int,int> > edges[V];
    //map<int, int> edges;

    for(int v=0;v<V;v++)
    {
        //cout <<"v :"<< v << endl;
        cout << "E :";
        cin>> E;
        for(int e=0;e<E;e++)
        {

            //cout <<"e :"<< e;
            int k,w;
            cout << "k :";
            cin>> k;
            cout <<"w :";
            cin>> w;
            edges[v].push_back(make_pair(k, w));
            //edges[v][k] = w;



        }
        cout<<endl;
    }
    /*
        vertex:3

        E:2
        k:1
        w:2

        k:2
        W:3
        E:1
        k:9
        w:3

        E:0

    */

}