Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Please use python and python file i/o to solve the problem. Create an input file input2_1.txt from the sample input as shown below, solve the problem and print the output to output2_1.txt file as shown in the question.

Please use python and python file i/o to solve the problem. Create an input file input2_1.txt from the sample input as shown below, solve the problem and print the output to output2_1.txt file as shown in the question.

Database System Concepts
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
icon
Related questions
Question
Please use python and python file i/o to solve the problem. Create an input file input2_1.txt from the sample input as shown below, solve the problem and print the output to output2_1.txt file as shown in the question.
43 1 2 1 232 435 14 Sample Input 2 Sample Output 2 Impossible 43 1 2 1 322 34 3 14 Sample Input 3 8 12 363 34 1 625 4 7 15 28 1 862 875 854 5 2 10 514 Time 5 Node 3 12 2 572 35 Sample Output 3 Time 8 Node 2 1 2 2 5 Sample Graph 2 1 15 2 Sample Graph 3. 3 5 4 2 10 8 1 1 2 3 5
Transcribed Image Text:43 1 2 1 232 435 14 Sample Input 2 Sample Output 2 Impossible 43 1 2 1 322 34 3 14 Sample Input 3 8 12 363 34 1 625 4 7 15 28 1 862 875 854 5 2 10 514 Time 5 Node 3 12 2 572 35 Sample Output 3 Time 8 Node 2 1 2 2 5 Sample Graph 2 1 15 2 Sample Graph 3. 3 5 4 2 10 8 1 1 2 3 5
Task 02: Alice and Bob are in a hurry to meet each other and have to traverse through a directed graph with weighted edges. Alice starts from node S and Bob starts from node T. They want to find a common node in the graph, where they can meet each other in the minimum amount of time. Alice or Bob can wait at any node if they want to. Input The first line contains two integers N (1 ≤ N≤ 10000) and M (1 ≤ M≤ 100000) separated by a space, denoting the number of nodes and edges in the graph, respectively. The next M lines each contain three integers, u, v (1 <= u, v <= N), and w (1 <= w <= 100) denoting an edge from node u to node v with weight w. The last line contains two integers S,T (1 <= S,T <= N) which denotes the starting node of Alice and the starting node of Bob respectively. Output Output two integers separated by a space. The first integer is the minimum time it takes for Alice and Bob to meet. The second integer is the vertex where they will meet. If there is no such node, print "Impossible".
Transcribed Image Text:Task 02: Alice and Bob are in a hurry to meet each other and have to traverse through a directed graph with weighted edges. Alice starts from node S and Bob starts from node T. They want to find a common node in the graph, where they can meet each other in the minimum amount of time. Alice or Bob can wait at any node if they want to. Input The first line contains two integers N (1 ≤ N≤ 10000) and M (1 ≤ M≤ 100000) separated by a space, denoting the number of nodes and edges in the graph, respectively. The next M lines each contain three integers, u, v (1 <= u, v <= N), and w (1 <= w <= 100) denoting an edge from node u to node v with weight w. The last line contains two integers S,T (1 <= S,T <= N) which denotes the starting node of Alice and the starting node of Bob respectively. Output Output two integers separated by a space. The first integer is the minimum time it takes for Alice and Bob to meet. The second integer is the vertex where they will meet. If there is no such node, print "Impossible".
Expert Solution
steps

Step by step

Solved in 4 steps with 3 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Header Files
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS