data structures with C++

without comments

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 node\{ int vertex; node * next; \}; 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 \#include \#define MAX_NODE 50 using namespace std; struct nodef int vertex; node next; bi node *adj[MAX_NODE]; //For storing Adjacency list of nodes. int totNodes; ///No. of Nodes in Graph. /////////////Queue Operation\IIIIIIIIIMIIIIIIIIMIMI int Qarray[MAX_NODE]; int front =1, rear =1; int isfull() return removed; ) roid createGraphi)\{ node "newl, "last; int neighbours,nv; coutse" Graph Creation-w \ h ;; couts"Enter total nodes in graph: ln"; cins>totNodes; for(int i=1;inv newl=new node; newl-svertexanv; newl->next=NULL; if (adj[i]==NULL) adj [i]=last=newl; elsef last->next = newl; last = newl; ) \} 3