data structures by C++

without comments please

A graph is a non-linear data structure that enables representing relationships between different types of data. There are two main parts of a graph G(V,E) : - The vertices (nodes) where the data is stored (V). - The edges (connections) which connect the nodes (E). A structure, which contains a vertex and a pointer to the connected vertex, is created as follows: struct nodel int vertex; node "next; li Main Operations - Graph Traversal - Breadth-First-Search (BFS) - Depth-First-Search (DFS) - Minimum Spanning Tree: Kruskal Prim Lab Assignment Consider the following C++ code, which contains the following: - Define a structure node - All Queue implementation needed to implement BFS - Graph creation function using adjacency list - Main function Hinclude ciostreams Hdefine MAX_NODE 50 using namespace std; struct nodef int vertex; node "next; 1 i. node *adj[MAX_NODE]: //For storing Adjacency list of nodes. int totNodes; //No. of Nodes in Graph. //////////// Queve Operation 1MMMMMMMMMMMMM int Qarray[MAX_NODE]; int front =1, rear =1; int isfull(): return removed; 1 roid createGraph()\{ node "newl, "last; int neighbours, nv; coutes Graph Creation n; cins>totNodes; for(int i=1;i That is Total Neighbours of "eeiee" :"; cins>neighbours; for(int j=1;j>nv newl=new node; newl->vertex=nv; newl next = NULL; if(adj[i]=mNULL) adj [i]= last=newl; elsef last > next = newl; last = newl; \} \} 1