This is a C++ Program. 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

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
This is a C++ Program.
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 (User will input the source / start)
    a. BFS 
    b. DFS
  3. Find Path (Given source and destination) 
  4. Path Cost (Given source and destination) 
  5. Exit Program 
  6. Main 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.

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
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]
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY