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:
Java Program to Find the Shortest Path from Source Vertex to All Other Vertices in Linear Time
Running Spring Boot Applications With Minikube
Case-Insensitive String Matching in Java
Consumer trong Java 8
Java Program to Implement the Monoalphabetic Cypher
Introduction to Spring Cloud CLI
Custom Cascading in Spring Data MongoDB
Life Cycle of a Thread in Java
Working with Network Interfaces in Java
Functional Interface trong Java 8
Java Program to Describe the Representation of Graph using Incidence List
HttpClient 4 Cookbook
Spring Boot with Multiple SQL Import Files
Java Program to Implement Karatsuba Multiplication Algorithm
Java Program to Implement First Fit Decreasing for 1-D Objects and M Bins
Jackson Date
Các nguyên lý thiết kế hướng đối tượng – SOLID
HashSet trong java
Deploy a Spring Boot WAR into a Tomcat Server
Java Program to Find a Good Feedback Vertex Set
Guide to the Volatile Keyword in Java
Java Program to Test Using DFS Whether a Directed Graph is Weakly Connected or Not
Convert Character Array to String in Java
Java Program to Implement Stack API
Zipping Collections in Java
Java Program to Implement Sorted Circularly Singly Linked List
Java Program to Implement AVL Tree
How to Convert List to Map in Java
How to Find an Element in a List with Java
Java Program to Implement Jarvis Algorithm
New Features in Java 12
Java Program to Implement Dijkstra’s Algorithm using Queue