This Java program,finds the transpose of graph matrix.In the mathematical and algorithmic study of graph theory, the converse,[1] transpose[2] or reverse[3] of a directed graph G is another directed graph on the same set of vertices with all of the edges reversed compared to the orientation of the corresponding edges in G. That is, if G contains an edge (u,v) then the converse/transpose/reverse of G contains an edge (v,u) and vice versa.
Here is the source code of the Java program to find the transpose of graph matrix. The Java program is successfully compiled and run on a Linux system. The program output is also shown below.
import java.util.Scanner; public class TransposeOfGraph { private int transposeMatrix[][]; private int numberOfVertices; public TransposeOfGraph(int numberOfVertices) { this.numberOfVertices = numberOfVertices; transposeMatrix = new int[numberOfVertices + 1][numberOfVertices + 1]; } public int[][] transpose(int adjacencyMatrix[][]) { for (int source = 1; source <= numberOfVertices; source++) { for (int destination = 1; destination <= numberOfVertices; destination++) { transposeMatrix[destination] = adjacencyMatrix[destination]; } } return transposeMatrix; } public static void main(String... arg) { int number_of_nodes; Scanner scanner = null; 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]; int transpose_matrix[][]; 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(); TransposeOfGraph transposeOfGraph = new TransposeOfGraph(number_of_nodes); transpose_matrix = transposeOfGraph.transpose(adjacency_matrix); System.out.println("The transpose of the given graph"); for (int i = 1; i <= number_of_nodes; i++) System.out.print("\t" + i); System.out.println(); for (int source = 1; source <= number_of_nodes; source++) { System.out.print(source +"\t"); for (int destination = 1; destination <= number_of_nodes; destination++) { System.out.print(transpose_matrix[destination] + "\t"); } System.out.println(); } scanner.close(); } }
$javac TransposeOfGraph.java $java TransposeOfGraph Enter the number of nodes in the graph 4 Enter the adjacency matrix 0 0 3 0 2 0 0 0 0 7 0 1 6 0 0 0 The transpose of the given graph 1 2 3 4 1 0 2 0 6 2 0 0 7 0 3 3 0 0 0 4 0 0 1 0
Related posts:
Java Program to Find Number of Articulation points in a Graph
Java Program to Compute the Area of a Triangle Using Determinants
Deploy a Spring Boot App to Azure
Iterable to Stream in Java
Hướng dẫn sử dụng Printing Service trong Java
Abstract class và Interface trong Java
Introduction to Using FreeMarker in Spring MVC
Java Program to Implement Cubic convergence 1/pi Algorithm
Fixing 401s with CORS Preflights and Spring Security
Java Program to Describe the Representation of Graph using Adjacency Matrix
New Features in Java 11
Lớp Properties trong java
Java Concurrency Interview Questions and Answers
Java Program to Permute All Letters of an Input String
Auditing with JPA, Hibernate, and Spring Data JPA
Java Program to Implement Branch and Bound Method to Perform a Combinatorial Search
The Order of Tests in JUnit
HttpClient Connection Management
Lập trình hướng đối tượng (OOPs) trong java
Configure a Spring Boot Web Application
Spring Boot - Database Handling
Rate Limiting in Spring Cloud Netflix Zuul
Upload and Display Excel Files with Spring MVC
How to Remove the Last Character of a String?
Java – String to Reader
Form Validation with AngularJS and Spring MVC
Java Program to Find the Longest Subsequence Common to All Sequences in a Set of Sequences
Generic Constructors in Java
How to use the Spring FactoryBean?
Spring Boot - Admin Client
How to Get a Name of a Method Being Executed?
Java Program for Douglas-Peucker Algorithm Implementation