This Java program,performs the DFS traversal on the given directed graph represented by a adjacency matrix to check connectivity.the DFS traversal makes use of an stack.
Here is the source code of the Java program to check the connectivity of a directed 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 DirectedConnectivityDfs { private Stack<Integer> stack; public DirectedConnectivityDfs() { stack = new Stack<Integer>(); } public void dfs(int adjacency_matrix[][], int source) { int number_of_nodes = adjacency_matrix.length - 1; int visited[] = new int[number_of_nodes + 1]; int element = source; int i = source; visited = 1; stack.push(source); while (!stack.isEmpty()) { element = stack.peek(); i = element; while (i <= number_of_nodes) { if (adjacency_matrix[element][i] == 1 && visited[i] == 0) { stack.push(i); visited[i] = 1; element = i; i = 1; continue; } i++; } stack.pop(); } boolean connected = false; for (int vertex = 1; vertex <= number_of_nodes; vertex++) { if (visited[vertex] == 1) { connected = true; } else { connected = false; break; } } if (connected) { System.out.println("The graph is connected"); }else { System.out.println("The graph is disconnected"); } } 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(); DirectedConnectivityDfs directedConnectivity= new DirectedConnectivityDfs(); directedConnectivity.dfs(adjacency_matrix, source); }catch(InputMismatchException inputMismatch) { System.out.println("Wrong Input format"); } scanner.close(); } }
$javac DirectedConnectivityDfs.java $java DirectedConnectivityDfs Enter the number of nodes in the graph 5 Enter the adjacency matrix 0 1 0 1 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 Enter the source for the graph 1 The graph is disconnected
Related posts:
Mapping Nested Values with Jackson
The Spring @Controller and @RestController Annotations
Java – Delete a File
Java Program to Solve any Linear Equations
Java Program to Implement wheel Sieve to Generate Prime Numbers Between Given Range
Một số từ khóa trong Java
Kiểu dữ liệu Ngày Giờ (Date Time) trong java
Java Program to Implement the RSA Algorithm
Guide to Dynamic Tests in Junit 5
Java Program to Test Using DFS Whether a Directed Graph is Strongly Connected or Not
Java Program to Generate a Sequence of N Characters for a Given Specific Case
Spring Data JPA @Query
Sắp xếp trong Java 8
How to Replace Many if Statements in Java
Java Program to Implement Dijkstra’s Algorithm using Set
Java Program to Implement Stein GCD Algorithm
The SpringJUnitConfig and SpringJUnitWebConfig Annotations in Spring 5
Java Program to Perform Postorder Non-Recursive Traversal of a Given Binary Tree
Hướng dẫn Java Design Pattern – Dependency Injection
Uploading MultipartFile with Spring RestTemplate
Spring Boot - Internationalization
How to Add a Single Element to a Stream
Luồng Daemon (Daemon Thread) trong Java
Guide to Spring Cloud Kubernetes
Concatenating Strings In Java
XML-Based Injection in Spring
Java Program to Implement Hash Tables Chaining with Doubly Linked Lists
An Introduction to ThreadLocal in Java
Getting the Size of an Iterable in Java
Converting Between an Array and a Set in Java
Java – InputStream to Reader
Supplier trong Java 8