#include using namespace std; typedef struct node{ int data; node* link; }node; typedef struct linkedList{ node* head; }linkedList; typedef struct Graph{ int noOfVertexes; linkedList* linked_list; Graph(int n){ this->linked_list = new linkedList[n + 1]; this->noOfVertexes = n; for(int i=0; i < n+1;i++){ this->linked_list[i].head = NULL; } }; }Graph; struct node* newNode(int value){ node *newNode = new node; newNode->data = value; newNode->link = NULL; return newNode; } void insertNode(Graph *G, int vertex, int vertex1){ node *new_node_one = newNode(vertex); node *new_node_two = newNode(vertex1); if(G->linked_list[vertex1].head == NULL){ G->linked_list->head = new_node_one; }else{ new_node_one->link = G->linked_list[vertex1].head; G->linked_list[vertex1].head = new_node_one; } if(G->linked_list[vertex].head == NULL){ G->linked_list[vertex].head = new_node_two; }else{ new_node_two->link = G->linked_list[vertex].head; G->linked_list[vertex].head = new_node_two; } } int main() { int i, v, e; cout<<"Enter the number of vertexes of the graph"; cin>>v; Graph *G = new Graph(v); cout>>"\nEnter the number of edges of the graph"; cin>>e; int edge[e][2]; for( i = 0; i < e; i++){ cout<<"\nEnter the vertex pair for the edge"<< i + 1; cout<<"\nVertex(1)"; cin>>edge[i][0]; cout<<"Vertex(2):"; cin>>edge[i][1]; insertNode(G,edge[i][0],edge[i][1]); } cout<<"\n\nThe adjacency list representation of the graph is given :"; for(i = 0, i < v; i++){ cout<<"\n\tVertex("< {"; while(G->linked_list[i+1].head != NULL){ cout<linked_list[i+1].head->data<<" "; G->linked_list[i+1].head = G->linked_list[i+1].head->link; } cout<<"}"; } }

Graph implemention using adjacency list