Java Program to Find Transpose of a Graph Matrix

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:

Sao chép các phần tử của một mảng sang mảng khác như thế nào?
How to Get the Last Element of a Stream in Java?
Serve Static Resources with Spring
Custom Cascading in Spring Data MongoDB
Java Program to Implement First Fit Decreasing for 1-D Objects and M Bins
Assertions in JUnit 4 and JUnit 5
4 tính chất của lập trình hướng đối tượng trong Java
Java Program to Implement Sieve Of Sundaram
An Introduction to ThreadLocal in Java
Spring Data JPA and Null Parameters
Jackson – JsonMappingException (No serializer found for class)
Truyền giá trị và tham chiếu trong java
Using Spring ResponseEntity to Manipulate the HTTP Response
Java Program to Give an Implementation of the Traditional Chinese Postman Problem
Java Program to Implement Efficient O(log n) Fibonacci generator
Introduction to Spring Cloud Rest Client with Netflix Ribbon
Retrieve User Information in Spring Security
Properties with Spring and Spring Boot
Java Program to Generate Randomized Sequence of Given Range of Numbers
Working with Network Interfaces in Java
Java Program to Implement Hash Tables Chaining with Doubly Linked Lists
Java Program to Implement Ternary Tree
Java Program to Implement EnumMap API
Marker Interface trong Java
Spring Cloud – Adding Angular
Registration – Password Strength and Rules
Java InputStream to String
An Intro to Spring Cloud Security
Java Program to Implement Gauss Jordan Elimination
Extract links from an HTML page
Quick Guide to Spring MVC with Velocity
Lập trình đa luồng với CompletableFuture trong Java 8