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 Solve the 0-1 Knapsack Problem
Pagination and Sorting using Spring Data JPA
Hướng dẫn Java Design Pattern – Mediator
Finding the Differences Between Two Lists in Java
Convert String to Byte Array and Reverse in Java
Các chương trình minh họa sử dụng Cấu trúc điều khiển trong Java
Spring Data Reactive Repositories with MongoDB
Java Program to Implement LinkedBlockingDeque API
Abstract class và Interface trong Java
Hướng dẫn Java Design Pattern – Adapter
Guide to Java OutputStream
Hướng dẫn Java Design Pattern – Strategy
Java Program to Implement Vector API
Spring Boot - Tracing Micro Service Logs
Lấy ngày giờ hiện tại trong Java
Java Program to Check if a Given Set of Three Points Lie on a Single Line or Not
Guide to java.util.concurrent.Locks
Jackson – Change Name of Field
Introduction to the Java NIO Selector
Java Program to Encode a Message Using Playfair Cipher
Extra Login Fields with Spring Security
Join and Split Arrays and Collections in Java
Query Entities by Dates and Times with Spring Data JPA
Java Program to Implement Pagoda
Java Program to Check if a Matrix is Invertible
Date Time trong Java 8
Java Program to Implement the String Search Algorithm for Short Text Sizes
Java Program to Check for balanced parenthesis by using Stacks
Introduction to Thread Pools in Java
Java Program to Solve Travelling Salesman Problem for Unweighted Graph
Spring Boot - Admin Client
Java Program to subtract two large numbers using Linked Lists