This Java program,implements Adjacency list.In graph theory and computer science, an adjacency list representation of a graph is a collection of unordered lists, one for each vertex in the graph. Each list describes the set of neighbors of its vertex.
Here is the source code of the Java program to display a linked list in reverse. The Java program is successfully compiled and run on a Linux system. The program output is also shown below.
import java.util.HashMap; import java.util.InputMismatchException; import java.util.LinkedList; import java.util.List; import java.util.Map; import java.util.Scanner; public class AdjacencyList { private Map<Integer,List<Integer>> Adjacency_List; public AdjacencyList(int number_of_vertices) { Adjacency_List = new HashMap<Integer, List<Integer>>(); for (int i = 1; i <= number_of_vertices; i++) { Adjacency_List.put(i, new LinkedList<Integer>()); } } public void setEdge(int source, int destination) { if (source > Adjacency_List.size() || destination > Adjacency_List.size()) { System.out.println("the vertex entered in not present "); return; } List<Integer> slist = Adjacency_List.get(source); slist.add(destination); List<Integer> dlist = Adjacency_List.get(destination); dlist.add(source); } public List<Integer> getEdge(int source) { if (source > Adjacency_List.size()) { System.out.println("the vertex entered is not present"); return null; } return Adjacency_List.get(source); } public static void main(String...arg) { int source, destination; int number_of_edges, number_of_vertices; int count = 1; Scanner scan = new Scanner(System.in); try { System.out.println("Enter the number of vertices and edges in graph"); number_of_vertices = scan.nextInt(); number_of_edges = scan.nextInt(); AdjacencyList adjacencyList = new AdjacencyList(number_of_vertices); System.out.println("Enter the edges in graph Format : <source index> <destination index>"); while (count <= number_of_edges) { source = scan.nextInt(); destination = scan.nextInt(); adjacencyList.setEdge(source, destination); count++; } System.out.println("the given Adjacency List for the graph \n"); for (int i = 1; i <= number_of_vertices; i++) { System.out.print(i+"->"); List<Integer> edgeList = adjacencyList.getEdge(i); for (int j = 1; ; j++ ) { if (j != edgeList.size()) System.out.print(edgeList.get(j - 1 ) + "->"); else { System.out.print(edgeList.get(j - 1 )); break; } } System.out.println(); } }catch (InputMismatchException inputMismatch) { System.out.println("Error in Input Format. \nFormat : <source index> <destination index>"); } scan.close(); } }
$javac AdjacencyList.java $java AdjacencyList Enter the number of vertices and edges in graph 4 5 Enter the edges in graph Format : <source index> <destination index> 1 2 2 3 3 4 4 1 1 3 the given Adjacency List for the graph 1->2->4->3 2->1->3 3->2->4->1 4->3->1
Related posts:
Introduction to Liquibase Rollback
Java Program to Implement Karatsuba Multiplication Algorithm
Spring Boot - Tomcat Deployment
Java Program to Describe the Representation of Graph using Adjacency List
Java Program to Implement Counting Sort
Java Program to Perform Deletion in a BST
Notify User of Login From New Device or Location
Allow user:password in URL
Spring Boot - Interceptor
Java Program to Convert a Decimal Number to Binary Number using Stacks
Returning Image/Media Data with Spring MVC
A Guide to JUnit 5
Java Program to Create the Prufer Code for a Tree
Spring Boot Integration Testing with Embedded MongoDB
Guide to Java 8’s Collectors
Setting Up Swagger 2 with a Spring REST API
Java Program to do a Depth First Search/Traversal on a graph non-recursively
Hướng dẫn Java Design Pattern – Builder
Java Program to Find Whether a Path Exists Between 2 Given Nodes
Registration – Activate a New Account by Email
So sánh Array và ArrayList trong Java
A Guide to TreeMap in Java
Using a Mutex Object in Java
The Registration Process With Spring Security
Functional Interface trong Java 8
Sử dụng JDBC API thực thi câu lệnh truy vấn dữ liệu
StringBuilder vs StringBuffer in Java
Mệnh đề Switch-case trong java
Một số nguyên tắc, định luật trong lập trình
Hướng dẫn sử dụng luồng vào ra ký tự trong Java
Xử lý ngoại lệ trong Java (Exception Handling)
Spring Data MongoDB Transactions