Create a data.h file that contains the data definition of the class based on the code and images below. CODE: Data.h #pragma once #include #include using namespace std; class Graph { private: int V; list *adj; //Programmer2 int **adj2; //Programmer2 void DFSUtil(int v, bool visited[]); //Lead void BFSUtil(int s, bool visited[]); //Lead public: Graph(int); //All void addEdge(int u, int v); //All void addEdge2(int u, int v); //Programmer2 void printGraph(); //All void printGraph2(); //Programmer2 void DFS(int v); //Lead void BFS(int s); //Lead
Create a data.h file that contains the data definition of the class based on the code and images below.
CODE:
Data.h
#pragma once
#include <list>
#include <iostream>
using namespace std;
class Graph
{
private:
int V;
list <int> *adj; //Programmer2
int **adj2; //Programmer2
void DFSUtil(int v, bool visited[]); //Lead
void BFSUtil(int s, bool visited[]); //Lead
public:
Graph(int); //All
void addEdge(int u, int v); //All
void addEdge2(int u, int v); //Programmer2
void printGraph(); //All
void printGraph2(); //Programmer2
void DFS(int v); //Lead
void BFS(int s); //Lead
};
![Problem Description
Make necessary changes to the Class Definition Graph ADT so
that it can store data in the following way:
(a)
Pointer
Index of
edge nodes
Weight
to next
adjacent vertex
edge node
graph
(0] "Atlanta
5 800
6.
600
[1] "Austin
200
160
[2] "Chicago
4 1000
(3] "Dallas
|1 200
2 900
4 780
[4] "Denver
0 1400
2 1000
[51 "Houston
0 800
[6] "Washington"
0 600
3 1300
[7]
[8]
[9]
en](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fb531decd-587e-4ca3-9464-a84188beaeea%2F91335a13-3ff5-45c8-a0c0-7a258b68fa80%2Fiotlahj_processed.png&w=3840&q=75)
Trending now
This is a popular solution!
Step by step
Solved in 7 steps with 4 images
