Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
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 <= u₁, V₁ <= 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 13 32 14 Sample Output 1 | NO Sample Graph 1

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 <= u₁, V₁ <= 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 13 32 14 Sample Output 1 | NO Sample Graph 1

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 input4_1.txt as shown below, solve the problem and print the output to output4_1.txt file as shown in the question.
× 43 1 3 32 14 input4_1.txt
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 <= u₁, V₁ <= 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 4 3 1 3 32 14 Sample Output 1 NO Sample Graph 1.
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 <= u₁, V₁ <= 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 4 3 1 3 32 14 Sample Output 1 NO Sample Graph 1.
Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Polynomial time
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