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:
Java Web Services – JAX-WS – SOAP
Changing Annotation Parameters At Runtime
Java Program to Implement Floyd Cycle Algorithm
Hướng dẫn Java Design Pattern – Bridge
Sử dụng CountDownLatch trong Java
Java – Byte Array to Reader
Java Program to Check if a Given Binary Tree is an AVL Tree or Not
Java – Reader to Byte Array
Query Entities by Dates and Times with Spring Data JPA
Java Program to Implement the Program Used in grep/egrep/fgrep
Spring Cloud – Securing Services
Java Program to Perform Stooge Sort
Debug a JavaMail Program
Java Program to Perform Inorder Recursive Traversal of a Given Binary Tree
Java Program to Perform Insertion in a BST
Quick Guide to Spring MVC with Velocity
Java Program to Implement Bresenham Line Algorithm
Java Program to Find the Connected Components of an UnDirected Graph
Using Spring ResponseEntity to Manipulate the HTTP Response
Guide to the Java ArrayList
Từ khóa throw và throws trong Java
StringBuilder vs StringBuffer in Java
Java Program to Implement Suffix Tree
Java Program to Generate All Subsets of a Given Set in the Lexico Graphic Order
Introduction to PCollections
Spring Boot Configuration with Jasypt
Spring Boot - Building RESTful Web Services
Java Program to Implement ArrayBlockingQueue API
Hướng dẫn sử dụng Java Annotation
ThreadPoolTaskExecutor corePoolSize vs. maxPoolSize
Java Program to Implement Knapsack Algorithm
Implementing a Runnable vs Extending a Thread