Computer Science Create a graph with ten nodes representing cities and edges between the nodes. representing roads connecting the cities. Create your own graph classes with a vertex class to represent city nodes, an edge class that represents a road (include a data item in the edge class for the road description, and a graph class with graph methods to connect the node edges together using an adjacency list (not adjacency matrix), a method to display the graph, and a method to traverse the graph (either dfs or bfs). Create a route method (the graph traversal method) that will give you a route from a starting city to a destination city. It does not have to be a shortest path. Write a program that implements the city/road network as a graph, asks for your input for a starting city and a destination city and calls the route method to find a route. Display the route including the highway names that you need to traverse. (Hint you can modify the DFS code in our lab example that traverses the whole graph to check whether the end node has been visited).

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
Computer Science
Create a graph with ten nodes representing
cities and edges between the nodes
representing roads connecting the cities. Create
your own graph classes with a vertex class to
represent city nodes, an edge class that
represents a road (include a data item in the
edge class for the road description, and a graph
class with graph methods to connect the node
edges together using an adjacency list (not
adjacency matrix), a method to display the
graph, and a method to traverse the graph
(either dfs or bfs). Create a route method (the
graph traversal method) that will give you a
route from a starting city to a destination city. It
does not have to be a shortest path. Write a
program that implements the city/road network
as a graph, asks for your input for a starting city
and a destination city and calls the route
method to find a route. Display the route
including the highway names that you need to
traverse. (Hint you can modify the DFS code in
our lab example that traverses the whole graph
to check whether the end node has been
visited).
Transcribed Image Text:Computer Science Create a graph with ten nodes representing cities and edges between the nodes representing roads connecting the cities. Create your own graph classes with a vertex class to represent city nodes, an edge class that represents a road (include a data item in the edge class for the road description, and a graph class with graph methods to connect the node edges together using an adjacency list (not adjacency matrix), a method to display the graph, and a method to traverse the graph (either dfs or bfs). Create a route method (the graph traversal method) that will give you a route from a starting city to a destination city. It does not have to be a shortest path. Write a program that implements the city/road network as a graph, asks for your input for a starting city and a destination city and calls the route method to find a route. Display the route including the highway names that you need to traverse. (Hint you can modify the DFS code in our lab example that traverses the whole graph to check whether the end node has been visited).
Expert Solution
steps

Step by step

Solved in 5 steps with 2 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