Answered: reate 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 (Programmer2)
b. Adjacency Matrix (Programmer2)
Traversal (User will input the source / start)
a. BFS (Lead Programmer)
b. DFS (Lead Programmer)
Find Path (Given source and destination) (Programmer2)
Path Cost (Given source and destination) (Lead Programmer)
Exit Program (Programmer1)
Main Program (Programmer1)

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.

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

Pointer
Index of
edge nodes
Weight
to next
adjacent vertex
edge node
graph
10] "Atlanta
5 800
6.
600
[1) "Austin
3 200
5 160
[2] "Chicago
4 1000
13] "Dallas
1 200
2 900
4 780
[4] "Denver
0 1400
2 1000
[5] "Houston
800
[6] "Washington"
0 600
3 1300
17]
[8]
[9]

Expert Solution

Step by step

Solved in 2 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