Skip to content

Added Floyd cycle detection algorithm in linkedlist package #242

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.

Sign up for GitHub

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

Closed
wants to merge 1 commit into from
Closed

Added Floyd cycle detection algorithm in linkedlist package #242

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
57 changes: 57 additions & 0 deletions data_structures/Lists/FloydCycleDetection.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,57 @@
package Lists;

/**
* An utility which detects a cycle in linked list using floyd algorithm
*
* @author mani manasa mylavarapu
*
*/
class FloydCycleDetection {
Node head;

class Node {
int data;
Node next;

Node(int d) {
data = d;
next = null;
}
}

public void insert(int val) {
Node node = new Node(val);
node.next = head;
head = node;
}

boolean detectLoop() {
Node slow_p = head, fast_p = head;
while (slow_p != null && fast_p != null && fast_p.next != null) {
slow_p = slow_p.next;
fast_p = fast_p.next.next;
if (slow_p == fast_p) {
return true;
}
}
return false;
}

public static void main(String args[]) {
FloydCycleDetection llist = new FloydCycleDetection();

llist.insert(2);
llist.insert(4);
llist.insert(5);
llist.insert(10);

/* Create loop for testing */
llist.head.next.next.next.next = llist.head;

if (llist.detectLoop()) {
System.out.println("found loop");
} else {
System.out.println("No loops detected");
}
}
}