Answered: Create the following operations and…

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

See similar textbooks

Related questions

Question

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.

Create Graph
a. Adjacency List
b. Adjacency Matrix
Traversal (User will input the source / start)
a. BFS
b. DFS
Find Path (Given source and destination)
Path Cost (Given source and destination)
Exit Program
Main Program

IMPORTANT NOTE: The program should include "Main.cpp" "Data.h" and "Implementation.cpp"

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.

Make necessary changes to the Class Definition Graph ADT so that it can store data in the following way (attached pictures)

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

(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]

Expert Solution

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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.

Similar questions