The given map will be an undirected and unweighted graph. The first line contains three integers N, M, and D (1 <= N, M, D <= 100) the number of cities, the total number of roads and the destination city. The next M lines will contain two integers u₁, v₁₂ (1 <= u₁₁< N) denoting there is a bidirectional road between u₁ and v₁.
The given map will be an undirected and unweighted graph. The first line contains three integers N, M, and D (1 <= N, M, D <= 100) the number of cities, the total number of roads and the destination city. The next M lines will contain two integers u₁, v₁₂ (1 <= u₁₁< N) denoting there is a bidirectional road between u₁ and v₁.
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
Related questions
Question
Please use python and python file i/o to solve the problem. Create an input file input5_1.txt as shown below, solve the problem and print the output to output5_1.txt file as shown in the question.
Transcribed Image Text:×
4 3 2
1 3
32
1 4
input5_1.txt
Transcribed Image Text:Task 05 (Find the shortest path):
The next day, Dora again called you for helping her. Among all
the cities she likes city 'D' the most.
Since you are becoming very much annoyed with Dora, you have
planned to reach city D spending the minimum amount of time.
In the belugaland, moving between two cities connected by a road
takes one second. You have to find the minimum time to reach D
and show the path in the output.
Dora and you will start your journey from city 1.
Input
The given map will be an undirected and unweighted graph.
The first line contains three integers N, M, and D (1 <= N, M, D
<= 100) the number of cities, the total number of roads and
the destination city.
The next M lines will contain two integers u₁, V₁ (1 <= ₁, V₁ <=
N) - denoting there is a bidirectional road between u₁ and v₁.
Output
Print the minimum amount of time to reach city D from city 1.
Next, print the shortest path you will follow.
Sample Input 1
432
1 3
32
14
Sample Input 2
665
1 3
32
14
26
5 6
46
Sample Output 1
Time: 2
Shortest Path: 1 3 2
Sample Output 2
Time: 3
Shortest Path: 1 4 65
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 3 images
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.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education