Sometimes, while dealing with graph problems in competitive programming, we have a list of pairs and we need to find if there is a possible cycle in it, and print all the elements in that cycle. Let’s discuss certain way in which this problem can be tackled.
Method : Using yield + loop + generator
The brute method to perform is to use a generator and keep printing the value if we know that the elements surely form a cycle and this is done by infinite loop and stopping when no more matches are found.
The original list is : [[6, 7], [9, 6], [7, 9]] The cycle elements are : 6 7 9
- Python | Pandas str.join() to join string/list elements with passed delimiter
- Python - Consecutive K elements join in List
- Python | Join tuple elements in a list
- Python | Ways to join pair of elements in list
- Python | Custom Cycle list
- Python MySQL - Join
- join() function in Python
- Python | os.path.join() method
- Python program to split and join a string
- Python | Merge, Join and Concatenate DataFrames using Panda
- Python - Itertools.cycle()
- Python Program for Cycle Sort
- Python Program for Detect Cycle in a Directed Graph
- Python String Methods | Set 2 (len, count, center, ljust, rjust, isalpha, isalnum, isspace & join)
- Python | Convert list of string to list of list
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.