Java program to describe the representation of graph using adjacency matrix.In mathematics and computer science, an adjacency matrix is a means of representing which vertices (or nodes) of a graph are adjacent to which other vertices. Another matrix representation for a graph is the incidence matrix.
Here is source code of the Java program to find the adjacency matrix of a given 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;
public class GraphAdjacencyMatrix
{
private final int MAX_NO_OF_VERTICES;
private int adjacency_matrix[][];
public GraphAdjacencyMatrix(int number_of_vertices)
{
MAX_NO_OF_VERTICES = number_of_vertices;
adjacency_matrix = new int[MAX_NO_OF_VERTICES + 1][MAX_NO_OF_VERTICES + 1];
}
public void setEdge(int from_vertex, int to_vertex, int edge)
{
try
{
adjacency_matrix[from_vertex][to_vertex] = edge;
} catch (ArrayIndexOutOfBoundsException indexBounce)
{
System.out.println("the vertex entered is not present");
}
}
public int getEdge(int from_vertex, int to_vertex)
{
try
{
return adjacency_matrix[from_vertex][to_vertex];
} catch (ArrayIndexOutOfBoundsException indexBounce)
{
System.out.println("the vertex entered is not present")
}
return -1;
}
public static void main(String... arg)
{
int number_of_vertices, count = 1;
int source = 0, destination = 0;
Scanner scan = new Scanner(System.in);
GraphAdjacencyMatrix adjacencyMatrix;
try
{
System.out.println("Enter the Number of Vertices");
number_of_vertices = scan.nextInt();
System.out.println("Enter the Number of Edges");
int number_of_edges = scan.nextInt();
adjacencyMatrix = new GraphAdjacencyMatrix(number_of_vertices);
System.out.println("Enter The Graph Egdes :<source> <destination>");
while (count <= number_of_edges)
{
source = scan.nextInt();
destination = scan.nextInt();
adjacencyMatrix.setEdge(source, destination, 1);
count++;
}
System.out.println("The adjacency matrix for given graph is");
for (int i = 1; i <= number_of_vertices; i++)
System.out.print(i);
System.out.println();
for (int i = 1; i <= number_of_vertices; i++)
{
System.out.print(i);
for (int j = 1; j <= number_of_vertices; j++)
{
System.out.print(adjacencyMatrix.getEdge(i, j));
}
System.out.println();
}
} catch (InputMismatchException inputMisMatch)
{
System.out.println("Error in Input Format.<source index> <destination index>");
}
scan.close();
}
}
$javac GraphAdjacencyMatrix.java $java GraphAdjacencyMatrix Enter the Number of Vertices and Edges 4 5 Enter The Graph Egdes Format : <source index> <destination index> 1 2 2 3 3 4 4 1 1 3 The adjacency matrix for given graph is 1 2 3 4 1 0 1 1 0 2 0 0 1 0 3 0 0 0 1 4 1 0 0 0
Related posts:
Java Program to Implement AVL Tree
Java Program to Implement Warshall Algorithm
Arrays.asList vs new ArrayList(Arrays.asList())
Java Program to Implement Park-Miller Random Number Generation Algorithm
Spring REST with a Zuul Proxy
Java – Combine Multiple Collections
Java Program to Implement Euler Circuit Problem
Giới thiệu SOAP UI và thực hiện test Web Service
Lớp Collectors trong Java 8
Java Program to Find Shortest Path Between All Vertices Using Floyd-Warshall’s Algorithm
Tránh lỗi NullPointerException trong Java như thế nào?
Java Program to Perform Naive String Matching
Một số tính năng mới về xử lý ngoại lệ trong Java 7
Derived Query Methods in Spring Data JPA Repositories
Converting Between Byte Arrays and Hexadecimal Strings in Java
Java Program to Implement ArrayList API
Introduction to Spring Data MongoDB
Java Program to find the maximum subarray sum using Binary Search approach
Java Program to Implement Gauss Seidel Method
Cachable Static Assets with Spring MVC
Convert String to Byte Array and Reverse in Java
Chuyển đổi từ HashMap sang ArrayList
Spring Cloud Bus
HttpClient Basic Authentication
Java Program to Implement HashSet API
Apache Commons Collections OrderedMap
How to Manually Authenticate User with Spring Security
Java Program to Apply DFS to Perform the Topological Sorting of a Directed Acyclic Graph
Java Collections Interview Questions
Java Byte Array to InputStream
String Processing with Apache Commons Lang 3
Java Program to Implement Pairing Heap