Vector Implementation

graph_adjacency_list_vector.cpp

#include<iostream>
#include<vector>
using namespace std;
void print_adj_list(vector< vector<int> > a);

int main(){
    vector< vector<int> > a;
    vector< int > b;
    int node, edge, s, e, i;
    cin>> node >> edge;
    for(i=0; i<node; i++){
        a.push_back(b);
    }
    for(int i=0; i<edge; i++){
        cin>> s >> e;
        a[s].push_back(e);
        a[e].push_back(s);
    }
    print_adj_list(a);

    return 0;
}
void print_adj_list(vector< vector<int> > a){
    for(int i=0;i<a.size();i++){
        cout<< i << " -> " ;
        for(int j=0; j<a[i].size();j++){
            cout<< a[i][j] << " ";
        }
        cout<<endl;
    }
}