Good day, I need help because I'm having difficulty on programming this in c++. Problem: Make necessary changes to the Class Definition Graph ADT so that it can store data in the following way (as...

Good day, I need help because I'm having difficulty on programming this in c++.

Problem:

Make necessary changes to the Class Definition Graph ADT so that it can store data in the following way (as seen in the attach images)

Create the following operations and include a menu-driven main program that will demonstrate your operations. The program will only stop when the user chooses 5 Exit Program.

1. Create Graph
a. Adjacency List
b. Adjacency Matrix

2. Traversal
a. BFS (Breadth First Search)
b. DFS (Depth First Search)

3. Find Path (Given Source and Destination)

4. Path Cost (Given Source and Destination)

5. Exit Program

Users will input name of places as string and your program will do the manipulation to convert it to an integer vertex. Also, you will have to convert integer vertex back to string when displaying back output to users. Cost will the basis on what vertex to take in BFS and DFS. Cost will only be displayed in option 4.

Extracted text: Dallas 1300 7 Washington Austin 6 6 1400 Denver Atlanta 160 Chicago Houston 008 008 0001 000 006 007 007


Extracted text: (a) Pointer Index of edge nodes Weight to next adjacent vertex edge node graph [0] |"Atlanta 5 800 6. 600 [1] "Austin 3 200 160 / [2] "Chicago 4 1000 [3] "Dallas 1 200 2 900 4 780 [4] "Denver 0 1400 2 1000 / [5] "Houston 800 [6] "Washington" 3 1300 600 [7] [8] [9]