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:
Spring Security Logout
Hướng dẫn Java Design Pattern – MVC
A Guide to TreeMap in Java
Java Program to Find the Edge Connectivity of a Graph
Spring Boot - File Handling
Upload and Display Excel Files with Spring MVC
Spring WebClient vs. RestTemplate
Tạo số và chuỗi ngẫu nhiên trong Java
Java Program to implement Priority Queue
Java Program to Represent Linear Equations in Matrix Form
Test a REST API with Java
Semaphore trong Java
Guava – Join and Split Collections
Join and Split Arrays and Collections in Java
Hướng dẫn Java Design Pattern – Visitor
Testing in Spring Boot
Java Program to Implement Bubble Sort
XML-Based Injection in Spring
More Jackson Annotations
Spring Boot Configuration with Jasypt
Giới thiệu Design Patterns
Sending Emails with Java
Creating a Web Application with Spring 5
Removing Elements from Java Collections
Spring Boot Integration Testing with Embedded MongoDB
Java Program to do a Depth First Search/Traversal on a graph non-recursively
Guide to Java 8 groupingBy Collector
The DAO with Spring and Hibernate
Guide to Selenium with JUnit / TestNG
Reactive WebSockets with Spring 5
HashMap trong Java hoạt động như thế nào?
Remove the First Element from a List