This is a java program to represent graph as a adjacency matrix. Nodes are arranged in matrix and at an index of i, j zero is displayed if nodes i and j are not connected, one otherwise.
Here is the source code of the Java Program to Represent Graph Using Adjacency Matrix. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
//This is a java program to represent graph as a adjacency matrix import java.util.Scanner; public class Represent_Graph_Adjacency_Matrix { private final int vertices; private int[][] adjacency_matrix; public Represent_Graph_Adjacency_Matrix(int v) { vertices = v; adjacency_matrix = new int[vertices + 1][vertices + 1]; } public void makeEdge(int to, int from, int edge) { try { adjacency_matrix[to][from] = edge; } catch (ArrayIndexOutOfBoundsException index) { System.out.println("The vertices does not exists"); } } public int getEdge(int to, int from) { try { return adjacency_matrix[to][from]; } catch (ArrayIndexOutOfBoundsException index) { System.out.println("The vertices does not exists"); } return -1; } public static void main(String args[]) { int v, e, count = 1, to = 0, from = 0; Scanner sc = new Scanner(System.in); Represent_Graph_Adjacency_Matrix graph; try { System.out.println("Enter the number of vertices: "); v = sc.nextInt(); System.out.println("Enter the number of edges: "); e = sc.nextInt(); graph = new Represent_Graph_Adjacency_Matrix(v); System.out.println("Enter the edges: <to> <from>"); while (count <= e) { to = sc.nextInt(); from = sc.nextInt(); graph.makeEdge(to, from, 1); count++; } System.out.println("The adjacency matrix for the given graph is: "); System.out.print(" "); for (int i = 1; i <= v; i++) System.out.print(i + " "); System.out.println(); for (int i = 1; i <= v; i++) { System.out.print(i + " "); for (int j = 1; j <= v; j++) System.out.print(graph.getEdge(i, j) + " "); System.out.println(); } } catch (Exception E) { System.out.println("Somthing went wrong"); } sc.close(); } }
Output:
$ javac Represent_Graph_Adjacency_Matrix.java $ java Represent_Graph_Adjacency_Matrix Enter the number of vertices: 5 Enter the number of edges: 7 Enter the edges: <to> <from> 1 1 2 3 3 4 4 5 3 5 1 4 2 4 The adjacency matrix for the given graph is: 1 2 3 4 5 1 1 0 0 1 0 2 0 0 1 1 0 3 0 0 0 1 1 4 0 0 0 0 1 5 0 0 0 0 0
Related posts:
Getting the Size of an Iterable in Java
Java Map With Case-Insensitive Keys
Java Program to Find Minimum Element in an Array using Linear Search
Java Program to Implement Disjoint Set Data Structure
Spring RestTemplate Error Handling
Java Program to Implement Sorted Doubly Linked List
Creating a Custom Starter with Spring Boot
Removing all duplicates from a List in Java
Properties with Spring and Spring Boot
Java Program to Implement Brent Cycle Algorithm
Java Program to Implement Hash Tables
Custom Cascading in Spring Data MongoDB
Java Program to Perform the Unique Factorization of a Given Number
Receive email by java client
Create a Custom Auto-Configuration with Spring Boot
Guide to java.util.concurrent.Future
Java Program to Implement Circular Doubly Linked List
Convert String to Byte Array and Reverse in Java
Java Program to Implement Network Flow Problem
Auditing with JPA, Hibernate, and Spring Data JPA
Giới thiệu Json Web Token (JWT)
Java Program to Solve Set Cover Problem assuming at max 2 Elements in a Subset
Spring Boot - Zuul Proxy Server and Routing
Java Program to Perform Searching Using Self-Organizing Lists
Java program to Implement Tree Set
Java Program to Implement WeakHashMap API
Java Program to Implement Ternary Tree
A Guide to Java HashMap
The Difference Between map() and flatMap()
Convert XML to JSON Using Jackson
Guide to Java OutputStream
Merging Streams in Java