This Java program,performs the DFS traversal on the given graph represented by a adjacency matrix to find all the forward edges in a graph.Forward Edges are which point from a node of the tree to one of its descendants.the DFS traversal makes use of an stack.
Here is the source code of the Java program to find the Forward Edges. 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 ForwardEgde { private Stack<Integer> stack; private HashMap<Integer, Integer> forwardEdges; private int adjacencyMatrix[][]; public ForwardEdge() { stack = new Stack<Integer>(); forwardEdges = new HashMap<Integer, 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)) { if (element < destination ) forwardEdges.put(element, destination); } } 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 void printForwardEdges() { System.out.println("\nSOURCE : DESTINATION"); Set<Integer> source = forwardEdges.keySet(); for (Integer sourcevertex : source) { System.out.println(sourcevertex + "\t:\t"+ forwardEdges.get(sourcevertex)); } } 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(); ForwardEdge forwardEdge = new ForwardEdge(); forwardEdge.dfs(adjacency_matrix, source); forwardEdge.printForwardEdges(); }catch(InputMismatchException inputMismatch) { System.out.println("Wrong Input format"); } scanner.close(); } }
$javac ForwardEdge.java $java ForwardEdge Enter the number of nodes in the graph 4 Enter the adjacency matrix 0 1 1 0 0 0 1 0 0 0 0 1 1 0 0 0 Enter the source for the graph 1 The Forward Edges are SOURCE : DESTINATION 1 : 3
Related posts:
Java Program to Implement Leftist Heap
Spring Data Java 8 Support
Từ khóa throw và throws trong Java
Getting Started with GraphQL and Spring Boot
Java Program to Find a Good Feedback Edge Set in a Graph
Java Program to Compute Discrete Fourier Transform Using Naive Approach
Java Program to Implement the Bin Packing Algorithm
Immutable Map Implementations in Java
Java Program to Implement Merge Sort Algorithm on Linked List
Optional trong Java 8
Java Program to Implement Depth-limited Search
Guide to Java 8 groupingBy Collector
Login For a Spring Web App – Error Handling and Localization
How to Round a Number to N Decimal Places in Java
Java Program to Check if it is a Sparse Matrix
Java Program to implement Bit Matrix
Java Program to Find the Shortest Path from Source Vertex to All Other Vertices in Linear Time
Spring Security Form Login
Server-Sent Events in Spring
Java InputStream to Byte Array and ByteBuffer
New Features in Java 9
A Guide to JUnit 5 Extensions
HTTP Authentification and CGI/Servlet
Java Program to Implement Weight Balanced Tree
Finding Max/Min of a List or Collection
Introduction to Liquibase Rollback
Spring WebClient vs. RestTemplate
Java Program to Find kth Largest Element in a Sequence
Java Program to Solve the Fractional Knapsack Problem
Java Program to Implement Wagner and Fisher Algorithm for online String Matching
Allow user:password in URL
Hướng dẫn Java Design Pattern – Service Locator