graph by adjacency list

// graph by adjacency list
#include<stdio.h>
#include<vector>
using namespace std;

int V, E;
int s, e;
vector<int> G[10];
int main()
{
    scanf("%d %d", &V, &E);
    for(int i=0; i<V; i++)
    {
        scanf("%d %d", &s, &e);
        G[s].push_back(e);
        G[e].push_back(s);
    }
}