// A simple representation of graph using STL
#include <bits/stdc++.h>
using namespace std;
// A utility function to add an edge in an
// undirected graph.
void addEdge(vector<int> adj[], int u, int v)
{
// adj[u] = v; in C programming
adj[u].push_back(v);
adj[v].push_back(u);
}
// A utility function to print the adjacency list
// representation of graph
void printGraph(vector<int> adj[], int V)
{
for (int v = 0; v < V; ++v) {
cout << "\n Adjacency list of vertex " << v
<< "\n head ";
for (auto x : adj[v])
cout << "-> " << x;
printf("\n");
}
}
// Driver code
int main()
{
int V = 5;
vector<int> adj[V];
addEdge(adj, 0, 1);
// Vertex 0 head -> 1
// Vertex 1 head -> 0
addEdge(adj, 0, 4);
// Vertex 0 head -> 1 -> 4
// Vertex 1 head -> 0
// Vertex 4 head -> 0
addEdge(adj, 1, 2);
// Vertex 0 head -> 1 -> 4
// Vertex 1 head -> 0 -> 2
// Vertex 2 head -> 1
// Vertex 4 head -> 0
addEdge(adj, 1, 3);
// Vertex 0 head -> 1 -> 4
// Vertex 1 head -> 0 -> 2 -> 3
// Vertex 2 head -> 1
// Vertex 3 head -> 1
// Vertex 4 head -> 0
addEdge(adj, 1, 4);
// Vertex 0 head -> 1 -> 4
// Vertex 1 head -> 0 -> 2 -> 3 -> 4
// Vertex 2 head -> 1
// Vertex 3 head -> 1
// Vertex 4 head -> 0 -> 1
addEdge(adj, 2, 3);
// Vertex 0 head -> 1 -> 4
// Vertex 1 head -> 0 -> 2 -> 3 -> 4
// Vertex 2 head -> 1 -> 3
// Vertex 3 head -> 1 -> 2
// Vertex 4 head -> 0 -> 1
addEdge(adj, 3, 4);
// Vertex 0 head -> 1 -> 4
// Vertex 1 head -> 0 -> 2 -> 3 -> 4
// Vertex 2 head -> 1 -> 3
// Vertex 3 head -> 1 -> 2 -> 4
// Vertex 4 head -> 0 -> 1 -> 3
printGraph(adj, V);
return 0;
}
