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:
Error Handling for REST with Spring
Java Program to Compute the Area of a Triangle Using Determinants
Hướng dẫn Java Design Pattern – Iterator
HttpAsyncClient Tutorial
Cachable Static Assets with Spring MVC
Class Loaders in Java
So sánh HashMap và HashSet trong Java
Template Engines for Spring
Các nguyên lý thiết kế hướng đối tượng – SOLID
Guide to Apache Commons CircularFifoQueue
Java – Write a Reader to File
ExecutorService – Waiting for Threads to Finish
HashMap trong Java hoạt động như thế nào?
Java Program to Implement Wagner and Fisher Algorithm for online String Matching
Lớp LinkedHashMap trong Java
How to Get a Name of a Method Being Executed?
Checking for Empty or Blank Strings in Java
Spring Security OAuth2 – Simple Token Revocation
Một số ký tự đặc biệt trong Java
Java Program to Implement Find all Forward Edges in a Graph
CyclicBarrier in Java
Java Program to Implement Hash Tables with Linear Probing
Spring Security Registration – Resend Verification Email
Spring Security Logout
Java Program to Perform LU Decomposition of any Matrix
Lớp TreeMap trong Java
Finding the Differences Between Two Lists in Java
Converting a List to String in Java
Java Program to Find the Longest Subsequence Common to All Sequences in a Set of Sequences
ArrayList trong java
Java Program to Implement HashTable API
Entity To DTO Conversion for a Spring REST API