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:
Java Program to Check if it is a Sparse Matrix
Java Program for Douglas-Peucker Algorithm Implementation
Java Program to Describe the Representation of Graph using Incidence List
Java Program to subtract two large numbers using Linked Lists
ETags for REST with Spring
Spring Boot - Tracing Micro Service Logs
Spring WebClient Requests with Parameters
Chuyển đổi giữa các kiểu dữ liệu trong Java
Converting a List to String in Java
Java Switch Statement
Spring MVC Custom Validation
JUnit 5 @Test Annotation
Convert Hex to ASCII in Java
Hướng dẫn tạo và sử dụng ThreadPool trong Java
Java Program to Create a Balanced Binary Tree of the Incoming Data
Java Program to Perform Arithmetic Operations on Numbers of Size
Java Program to Find ith Largest Number from a Given List Using Order-Statistic Algorithm
String Joiner trong Java 8
Get the workstation name or IP
Java Program to Encode a Message Using Playfair Cipher
Create Java Applet to Simulate Any Sorting Technique
Java Program to Implement PrinterStateReasons API
Removing Elements from Java Collections
The Registration Process With Spring Security
Transactions with Spring and JPA
An Intro to Spring Cloud Security
Java Program to Find the Vertex Connectivity of a Graph
The Order of Tests in JUnit
Java Program to Implement Quick Hull Algorithm to Find Convex Hull
Sorting in Java
Introduction to Spring Cloud Stream
Java Program to Implement Skew Heap