× 43 1 3 32 1 4 input4_1.txt
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 input4_1.txt as shown below, solve the problem and print the output to output4_1.txt file as shown in the question.
Transcribed Image Text:×
43
1 3
32
14
input4_1.txt
![Task 04 (Cycle Finding):
It was a very hectic day for Dora. Before going to sleep, Dora
wants to find out if there is any Cycle in the map of the city.
Since Dora has traveled the whole country twice, she is feeling
very exhausted and asks you to solve the problem. However, Dora
has made the roads of the cities directed in her map, so that
you don't get bored.
In graph theory, a cycle in a graph is a non-empty trail in
which only the first and last vertices are equal. [Wikipedia]
Input:
The given map will be a directed and unweighted graph.
The first line contains two integers N and M (1 <= N, M <= 100)
the number of cities and the total number of roads.
The next M lines will contain two integers u₁, V₁ (1 <= ₁,₁ <=
N) - denoting there is a bidirectional road between u₁ and v₁.
Output:
Print "YES" if the map contains any Cycle, otherwise print "NO".
Sample Input 1
43
1 3
32
14
Sample Input 2
44
3 1
32
14
43
Sample Output 1
NO
Sample Output 2
YES
Sample Graph 1
Sample Graph 2](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fa115738e-b682-4860-874b-8e2f04c617ea%2F6e8826b7-deb7-4ce5-9164-1656f2f2f8cd%2Fr7bphu6_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Task 04 (Cycle Finding):
It was a very hectic day for Dora. Before going to sleep, Dora
wants to find out if there is any Cycle in the map of the city.
Since Dora has traveled the whole country twice, she is feeling
very exhausted and asks you to solve the problem. However, Dora
has made the roads of the cities directed in her map, so that
you don't get bored.
In graph theory, a cycle in a graph is a non-empty trail in
which only the first and last vertices are equal. [Wikipedia]
Input:
The given map will be a directed and unweighted graph.
The first line contains two integers N and M (1 <= N, M <= 100)
the number of cities and the total number of roads.
The next M lines will contain two integers u₁, V₁ (1 <= ₁,₁ <=
N) - denoting there is a bidirectional road between u₁ and v₁.
Output:
Print "YES" if the map contains any Cycle, otherwise print "NO".
Sample Input 1
43
1 3
32
14
Sample Input 2
44
3 1
32
14
43
Sample Output 1
NO
Sample Output 2
YES
Sample Graph 1
Sample Graph 2
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 3 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