Adjacency List

#include<iostream>
#include<cstdio>
#include<cmath>
#include<vector>
#include<list>

using namespace std;

int main()
{

    list<int> adj[100];
    list<int>::iterator it;
    int v,a,b,k=1,i;
    cout<<"Input No Of Vertex: ";
    cin>>v;
    do
    {
        //cout<<"Input No Of Edges"<<endl;
        cout<<"Edge "<<k<<endl;
        cin>>a>>b;
        if(a<=v && b<=v)
        {
           adj[a].push_back(b);
           adj[b].push_back(a);
           k++;
        }

        else
        {
            cout<<"Invalid Input!!"<<endl;
        }



    }while(a!=0 || b!=0);

    for(i=1;i<=v;i++)
    {
        printf("adj[%d]",i);
        for(it=adj[i].begin();it!=adj[i].end();it++)
        {
            printf("-> %d",*it);
        }

        cout<<endl;
    }

    return 0;

}