Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Create LOOP DETECTION.py #110

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
66 changes: 66 additions & 0 deletions LOOP DETECTION.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,66 @@
class Node:

# Constructor to initialize
# the node object
def __init__(self, data):
self.data = data
self.next = None


class LinkedList:

# Function to initialize head
def __init__(self):
self.head = None

# Function to insert a new
# node at the beginning
def push(self, new_data):
new_node = Node(new_data)
new_node.next = self.head
self.head = new_node

# Utility function to print it
# the linked LinkedList
def printList(self):
temp = self.head
while(temp):
print(temp.data, end=" ")
temp = temp.next

def detectLoop(self):
s = set()
temp = self.head
while (temp):

# If we already have
# this node in hashmap it
# means there is a cycle
# (Because we are encountering
# the node second time).
if (temp in s):
return True

# If we are seeing the node for
# the first time, insert it in hash
s.add(temp)

temp = temp.next

return False


# Driver program for testing
llist = LinkedList()
llist.push(20)
llist.push(4)
llist.push(15)
llist.push(10)

# Create a loop for testing
llist.head.next.next.next.next = llist.head

if(llist.detectLoop()):
print("Loop found")
else:
print("No Loop ")