Java program to describe the implement Adjacency Matrix. The Adjacency Matrix is used to represent a graph.The adjacency matrix of a finite graph G on n vertices is the n × n matrix where the non-diagonal entry aij is the number of edges from vertex i to vertex j, and the diagonal entry aii, depending on the convention, is either once or twice the number of edges (loops) from vertex i to itself.
Here is source code of the Java program to implement the Adjacency Matrix.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 AdjacencyMatrix { private final int MAX_NO_OF_VERTICES; private int adjacency_matrix[][]; public AdjacencyMatrix(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); AdjacencyMatrix 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 AdjacencyMatrix(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 AdjacencyMatrix.java $java AdjacencyMatrix 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 Johnson’s Algorithm
More Jackson Annotations
Tạo ứng dụng Java RESTful Client với thư viện OkHttp
Rest Web service: Filter và Interceptor với Jersey 2.x (P1)
Extract network card address
Java Program to Create a Minimal Set of All Edges Whose Addition will Convert it to a Strongly Conne...
Java Program to Implement Euclid GCD Algorithm
Java – Generate Random String
Mapping Nested Values with Jackson
Quick Guide to Spring MVC with Velocity
Java Program to Perform Searching Using Self-Organizing Lists
Java Program to Implement Floyd-Warshall Algorithm
Exception Handling in Java
Sử dụng JDBC API thực thi câu lệnh truy vấn dữ liệu
A Guide to System.exit()
Get and Post Lists of Objects with RestTemplate
Java Program to Perform Deletion in a BST
Simple Single Sign-On with Spring Security OAuth2
Serve Static Resources with Spring
Using JWT with Spring Security OAuth
Java Program to Perform Partition of an Integer in All Possible Ways
Overview of the java.util.concurrent
Using a Spring Cloud App Starter
Overview of Spring Boot Dev Tools
Initialize a HashMap in Java
@Before vs @BeforeClass vs @BeforeEach vs @BeforeAll
Java Program to Implement Gauss Seidel Method
Java Program to Check the Connectivity of Graph Using BFS
Java Program to Implement Hash Trie
HashMap trong Java hoạt động như thế nào?
wait() and notify() Methods in Java
New Stream Collectors in Java 9