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:
Finding Max/Min of a List or Collection
Hướng dẫn sử dụng Java Annotation
Spring REST with a Zuul Proxy
Java Program to Implement Threaded Binary Tree
Concrete Class in Java
Comparing Dates in Java
The Order of Tests in JUnit
Sử dụng Fork/Join Framework với ForkJoinPool trong Java
Deploy a Spring Boot WAR into a Tomcat Server
Guide to the Volatile Keyword in Java
Java Program to Implement Solovay Strassen Primality Test Algorithm
Guide To CompletableFuture
Generating Random Dates in Java
Java Program to Implement Sparse Matrix
Creating a Web Application with Spring 5
Hướng dẫn sử dụng luồng vào ra nhị phân trong Java
Read an Outlook MSG file
Java Program to Test Using DFS Whether a Directed Graph is Weakly Connected or Not
Enum trong java
A Guide to Apache Commons Collections CollectionUtils
Hướng dẫn Java Design Pattern – Facade
Giới thiệu Aspect Oriented Programming (AOP)
Apache Commons Collections BidiMap
Spring @RequestParam Annotation
Converting a List to String in Java
Java Program to Implement the Monoalphabetic Cypher
Java Program to Implement Word Wrap Problem
Java Byte Array to InputStream
Java Program to Find Location of a Point Placed in Three Dimensions Using K-D Trees
Create a Custom Auto-Configuration with Spring Boot
Java Program to Implement Booth Algorithm
Sao chép các phần tử của một mảng sang mảng khác như thế nào?