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.
Good day, I need help because I'm having difficulty on
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.
![(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]](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F496a0678-f165-4e25-88a1-1e2865b42d05%2Fcbd92e76-298d-4b84-8eb2-3450fd53b909%2F95fwxk_processed.png&w=3840&q=75)
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
