A C++ Program 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 NOTE: 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.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

A C++ Program

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

NOTE: 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.

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
0 800
[6] "Washington"
0 600
3 1300
[7]
[8]
[9]
Transcribed Image Text: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 0 800 [6] "Washington" 0 600 3 1300 [7] [8] [9]
Dallas
200
1300
200
7
8
Austin
Washington
Denver
1400
Atlanta
800
Chicago
Houston
08
600
160
0001
0001
006
Transcribed Image Text:Dallas 200 1300 200 7 8 Austin Washington Denver 1400 Atlanta 800 Chicago Houston 08 600 160 0001 0001 006
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Knowledge Booster
Linked List Representation
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education