Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
a) Create a graph using the cities as vertices and the edges as interstates, use only the cities listed below. Indude an edge if the two cities are connected by an interstate. Use the table of the interstate distances between cities (in miles) to do the following ROCK Rockford ROCH Rochelle CHI Chicago Joliet JOL CHA Champaign-Urbana Effingham EFF MTV Mount Vernon ESTL East St. Louis SPR Springfield UN Lincoln BN Bloomington-Normal PEO Peoria QC Quad Cities Peru PERU RCK RCH CHI JOL CHA EFF MTV ESTL SPR LIN BN PEO QC PERU RCK 32 88 RCH 32 81 88 48 CHI 88 81 45 JOL 45 107 91 61 CHA 107 83 92 56 EFF 83 69 98 MTV 69 75 ESTL 98 75 93 SPR 92 93 38 LIN 38 45 45 BN 91 56 45 45 64 PEO 45 45 QC 88 93 80 PERU 48 61 64 80 b) Design a trip, starting in Peoria, that will visit Chicago, Champaign-Urbana, and Rockford you want to plan a stop at two historic sites along your route and you will end up in Effingham. Draw your graph ) Find the path that will minimize your distance; use Djkstra's Algorithm here c) Design a trip starting and ending in Peona, that will visit the cities of East St Louis Peru Springfield and Joliet you also are planning a stop at two historic sites along the way 93

a) Create a graph using the cities as vertices and the edges as interstates, use only the cities listed below. Indude an edge if the two cities are connected by an interstate. Use the table of the interstate distances between cities (in miles) to do the following ROCK Rockford ROCH Rochelle CHI Chicago Joliet JOL CHA Champaign-Urbana Effingham EFF MTV Mount Vernon ESTL East St. Louis SPR Springfield UN Lincoln BN Bloomington-Normal PEO Peoria QC Quad Cities Peru PERU RCK RCH CHI JOL CHA EFF MTV ESTL SPR LIN BN PEO QC PERU RCK 32 88 RCH 32 81 88 48 CHI 88 81 45 JOL 45 107 91 61 CHA 107 83 92 56 EFF 83 69 98 MTV 69 75 ESTL 98 75 93 SPR 92 93 38 LIN 38 45 45 BN 91 56 45 45 64 PEO 45 45 QC 88 93 80 PERU 48 61 64 80 b) Design a trip, starting in Peoria, that will visit Chicago, Champaign-Urbana, and Rockford you want to plan a stop at two historic sites along your route and you will end up in Effingham. Draw your graph ) Find the path that will minimize your distance; use Djkstra's Algorithm here c) Design a trip starting and ending in Peona, that will visit the cities of East St Louis Peru Springfield and Joliet you also are planning a stop at two historic sites along the way 93

Computer Networking: A Top-Down Approach (7th Edition)
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...
See similar textbooks
icon
Related questions
Question
100%
a) Create a graph using the cities as vertices and the edges as interstates, use only the cities listed below. Include an edge if the two cities are connected by an interstate. Use the table of the interstate distances between cities (in miles) to do the following ROCK Rockford ROCH Rochelle CHI Chicago Joliet JOL CHA Champaign-Urbana EFF Effingham MTV Mount Vernon East St. Louis ESTL SPR Springfield LIN Lincoln Bloomington-Normal BN PEO Peoria QC Quad Cities PERU Peru RCK RCH CHI JOL CHA EFF MTV ESTL SPR LIN BN PEO QC PERU RCK 32 88 RCH 32 81 88 48 CHI 88 81 45 JOL 45 107 91 61 CHA 107 83 92 56 EFF 83 69 98 MTV 69 75 ESTL 98 75 93 SPR 92 93 38 LIN 38 45 45 BN 91 56 45 45 64 PEO 45 45 93 QC 88 93 80 PERU 48 61 64 80 b) Design a trip, starting in Peoria, that will visit Chicago, Champaign-Urbana, and Rockford, you want to plan a stop at two historic sites along your route and you will end up in Effingham. Draw your graph Find the path that will minimize your distance; use Djkstra's Algorithm here c) Design a trip starting and ending in Peonia, that will visit the cities of East St. Louis. Peru, Springfield and Joliet you also are planning a stop at two historic sites along the way i) Draw your graph
Transcribed Image Text:a) Create a graph using the cities as vertices and the edges as interstates, use only the cities listed below. Include an edge if the two cities are connected by an interstate. Use the table of the interstate distances between cities (in miles) to do the following ROCK Rockford ROCH Rochelle CHI Chicago Joliet JOL CHA Champaign-Urbana EFF Effingham MTV Mount Vernon East St. Louis ESTL SPR Springfield LIN Lincoln Bloomington-Normal BN PEO Peoria QC Quad Cities PERU Peru RCK RCH CHI JOL CHA EFF MTV ESTL SPR LIN BN PEO QC PERU RCK 32 88 RCH 32 81 88 48 CHI 88 81 45 JOL 45 107 91 61 CHA 107 83 92 56 EFF 83 69 98 MTV 69 75 ESTL 98 75 93 SPR 92 93 38 LIN 38 45 45 BN 91 56 45 45 64 PEO 45 45 93 QC 88 93 80 PERU 48 61 64 80 b) Design a trip, starting in Peoria, that will visit Chicago, Champaign-Urbana, and Rockford, you want to plan a stop at two historic sites along your route and you will end up in Effingham. Draw your graph Find the path that will minimize your distance; use Djkstra's Algorithm here c) Design a trip starting and ending in Peonia, that will visit the cities of East St. Louis. Peru, Springfield and Joliet you also are planning a stop at two historic sites along the way i) Draw your graph
ii) Find the path that will minimize your time; assume 70 mph travel along each edge and 30 mph from interstate to the historic site; use the Nearest Neighbor Algorithm. d) Using your original graph, is an Euler circuit possible? If not, Eulerize the graph and find an Euler circuit. e) Using your original graph, is a Hamiltonian circuit possible? If so, identify it. f) Add to your original graph the cities of Quincy and Marion. If Quincy to Springfield is 111 miles and Mount Vernon to Marion is 46 miles, find a minimum distance spanning tree using Kruskal's Algorithm.
Transcribed Image Text:ii) Find the path that will minimize your time; assume 70 mph travel along each edge and 30 mph from interstate to the historic site; use the Nearest Neighbor Algorithm. d) Using your original graph, is an Euler circuit possible? If not, Eulerize the graph and find an Euler circuit. e) Using your original graph, is a Hamiltonian circuit possible? If so, identify it. f) Add to your original graph the cities of Quincy and Marion. If Quincy to Springfield is 111 miles and Mount Vernon to Marion is 46 miles, find a minimum distance spanning tree using Kruskal's Algorithm.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
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
SEE MORE TEXTBOOKS