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 Perform Cryptography Using Transposition Technique
TreeSet và sử dụng Comparable, Comparator trong java
Java Program to Implement Unrolled Linked List
Encode/Decode to/from Base64
Check If a String Is Numeric in Java
Concrete Class in Java
Registration – Password Strength and Rules
Java Program to Implement Booth Algorithm
Java Program to Find the Mode in a Data Set
Guide to Spring @Autowired
Java Program to Search for an Element in a Binary Search Tree
Hướng dẫn Java Design Pattern – Factory Method
Java Program to Perform Partial Key Search in a K-D Tree
Hướng dẫn sử dụng Java String, StringBuffer và StringBuilder
Sao chép các phần tử của một mảng sang mảng khác như thế nào?
A Guide to the ViewResolver in Spring MVC
Java 8 Collectors toMap
Một số ký tự đặc biệt trong Java
Using JWT with Spring Security OAuth (legacy stack)
Java Program to Implement DelayQueue API
Deque và ArrayDeque trong Java
Java Program to Check Whether a Directed Graph Contains a Eulerian Cycle
Limiting Query Results with JPA and Spring Data JPA
Creating Docker Images with Spring Boot
Guide to Guava Multimap
Java Program to Generate a Graph for a Given Fixed Degree Sequence
Lớp Collectors trong Java 8
A Guide to Concurrent Queues in Java
Sử dụng CountDownLatch trong Java
Java Program to Implement Maximum Length Chain of Pairs
Loại bỏ các phần tử trùng trong một ArrayList như thế nào trong Java 8?
Chuyển đổi từ HashMap sang ArrayList