This Java program,performs the DFS traversal on the given graph represented by a adjacency matrix to check for cycles in the graph.the DFS traversal makes use of an stack.
Here is the source code of the Java program to check for cycle in graph.The Java program is successfully compiled and run on a Linux system. The program output is also shown below.
import java.util.InputMismatchException; import java.util.Scanner; import java.util.Stack; public class CheckCycle { private Stack<Integer> stack; private int adjacencyMatrix[][]; public CheckCycle() { stack = new Stack<Integer>(); } public void dfs(int adjacency_matrix[][], int source) { int number_of_nodes = adjacency_matrix.length - 1; adjacencyMatrix = new int[number_of_nodes + 1][number_of_nodes + 1]; for (int sourcevertex = 1; sourcevertex <= number_of_nodes; sourcevertex++) { for (int destinationvertex = 1; destinationvertex <= number_of_nodes; destinationvertex++) { adjacencyMatrix[sourcevertex][destinationvertex] = adjacency_matrix[sourcevertex][destinationvertex]; } } int visited[] = new int[number_of_nodes + 1]; int element = source; int destination = source; visited = 1; stack.push(source); while (!stack.isEmpty()) { element = stack.peek(); destination = element; while (destination <= number_of_nodes) { if (adjacencyMatrix[element][destination] == 1 && visited[destination] == 1) { if (stack.contains(destination)) { System.out.println("The Graph contains cycle"); return; } } if (adjacencyMatrix[element][destination] == 1 && visited[destination] == 0) { stack.push(destination); visited[destination] = 1; adjacencyMatrix[element][destination] = 0; element = destination; destination = 1; continue; } destination++; } stack.pop(); } } public static void main(String...arg) { int number_of_nodes, source; Scanner scanner = null; try { System.out.println("Enter the number of nodes in the graph"); scanner = new Scanner(System.in); number_of_nodes = scanner.nextInt(); int adjacency_matrix[][] = new int[number_of_nodes + 1][number_of_nodes + 1]; System.out.println("Enter the adjacency matrix"); for (int i = 1; i <= number_of_nodes; i++) for (int j = 1; j <= number_of_nodes; j++) adjacency_matrix[i][j] = scanner.nextInt(); System.out.println("Enter the source for the graph"); source = scanner.nextInt(); CheckCycle checkCycle = new CheckCycle(); checkCycle.dfs(adjacency_matrix, source); }catch(InputMismatchException inputMismatch) { System.out.println("Wrong Input format"); } scanner.close(); } }
$javac CheckCycle.java $java CheckCycle Enter the number of nodes in the graph 5 Enter the adjacency matrix 0 0 0 1 0 1 0 1 0 0 0 0 0 0 0 0 1 0 0 1 0 0 1 0 0 Enter the source for the graph 1 The Graph contains a cycle
Related posts:
Guide to Selenium with JUnit / TestNG
Java Program to Compute Determinant of a Matrix
Simultaneous Spring WebClient Calls
Java Program to Implement Double Order Traversal of a Binary Tree
Một số tính năng mới về xử lý ngoại lệ trong Java 7
Intro to Spring Boot Starters
Java Program to Implement LinkedBlockingQueue API
Java Program to Find Location of a Point Placed in Three Dimensions Using K-D Trees
Java Collections Interview Questions
Java Program to Represent Graph Using Adjacency Matrix
Reading an HTTP Response Body as a String in Java
Java – File to Reader
A Guide to JUnit 5
Java Program to Implement CopyOnWriteArrayList API
Redirect to Different Pages after Login with Spring Security
Spring 5 and Servlet 4 – The PushBuilder
Java Program to Perform the Unique Factorization of a Given Number
Quick Guide to @RestClientTest in Spring Boot
New Features in Java 15
Các chương trình minh họa sử dụng Cấu trúc điều khiển trong Java
Java Program to Implement Fisher-Yates Algorithm for Array Shuffling
Constructor Injection in Spring with Lombok
Java Program to Check if a Given Binary Tree is an AVL Tree or Not
Java Program to Implement Gauss Jordan Elimination
Send an email with an attachment
Java Program to Implement Heap’s Algorithm for Permutation of N Numbers
Xây dựng ứng dụng Client-Server với Socket trong Java
List Interface trong Java
Java Program to Find kth Largest Element in a Sequence
Guide to Java OutputStream
Guide to @JsonFormat in Jackson
Java Program to Generate Randomized Sequence of Given Range of Numbers