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:
Spring Boot - Flyway Database
Hướng dẫn Java Design Pattern – Singleton
Simple Single Sign-On with Spring Security OAuth2
Java Program to Implement Nth Root Algorithm
Java Program to Implement Bubble Sort
@DynamicUpdate with Spring Data JPA
The Difference Between map() and flatMap()
A Guide to Spring Boot Admin
Java Program to Check whether Directed Graph is Connected using DFS
Java Program to Generate All Subsets of a Given Set in the Gray Code Order
Graph Data Stucture
Java Program to Perform Insertion in a 2 Dimension K-D Tree
Hướng dẫn Java Design Pattern – Memento
Java IO vs NIO
Java Program to Implement Red Black Tree
Mix plain text and HTML content in a mail
Java Program to Implement the Bin Packing Algorithm
OAuth 2.0 Resource Server With Spring Security 5
Registration – Password Strength and Rules
Rest Web service: Filter và Interceptor với Jersey 2.x (P1)
Model, ModelMap, and ModelAndView in Spring MVC
Annotation trong Java 8
A Guide to LinkedHashMap in Java
Auditing with JPA, Hibernate, and Spring Data JPA
So sánh Array và ArrayList trong Java
Check whether a graph is bipartite
Java Deep Learning Essentials - Yusuke Sugomori
Hướng dẫn kết nối cơ sở dữ liệu với Java JDBC
Find the Registered Spring Security Filters
Tìm hiểu về Web Service
Xử lý ngoại lệ đối với trường hợp ghi đè phương thức trong java
Mảng (Array) trong Java