This is a java program to represent graph as a adjacency list. Each node will have a linked list consisting of node to which it is connected.
Here is the source code of the Java Program to Represent Graph Using Adjacency List. 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 list import java.util.HashMap; import java.util.LinkedList; import java.util.List; import java.util.Map; import java.util.Scanner; public class Represent_Graph_Adjacency_List { private Map<Integer, List<Integer>> adjacencyList; public Represent_Graph_Adjacency_List(int v) { adjacencyList = new HashMap<Integer, List<Integer>>(); for (int i = 1; i <= v; i++) adjacencyList.put(i, new LinkedList<Integer>()); } public void setEdge(int to, int from) { if (to > adjacencyList.size() || from > adjacencyList.size()) System.out.println("The vertices does not exists"); List<Integer> sls = adjacencyList.get(to); sls.add(from); List<Integer> dls = adjacencyList.get(from); dls.add(to); } public List<Integer> getEdge(int to) { if (to > adjacencyList.size()) { System.out.println("The vertices does not exists"); return null; } return adjacencyList.get(to); } public static void main(String args[]) { int v, e, count = 1, to, from; Scanner sc = new Scanner(System.in); Represent_Graph_Adjacency_List glist; try { System.out.println("Enter the number of vertices: "); v = sc.nextInt(); System.out.println("Enter the number of edges: "); e = sc.nextInt(); glist = new Represent_Graph_Adjacency_List(v); System.out.println("Enter the edges in the graph : <to> <from>"); while (count <= e) { to = sc.nextInt(); from = sc.nextInt(); glist.setEdge(to, from); count++; } System.out .println("The Adjacency List Representation of the graph is: "); for (int i = 1; i <= v; i++) { System.out.print(i + "->"); List<Integer> edgeList = glist.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 (Exception E) { System.out.println("Something went wrong"); } sc.close(); } }
Output:
$ javac Represent_Graph_Adjacency_List.java $ java Represent_Graph_Adjacency_List Enter the number of vertices: 4 5 Enter the number of edges: Enter the edges in the graph : <to> <from> 1 2 2 3 3 4 4 1 1 3 The Adjacency List Representation of the graph is: 1 -> 2 -> 4 -> 3 2 -> 1 -> 3 3 -> 2 -> 4 -> 1 4 -> 3 -> 1
Related posts:
Object Type Casting in Java
Debug a HttpURLConnection problem
Java Program to Find Location of a Point Placed in Three Dimensions Using K-D Trees
Hướng dẫn sử dụng String Format trong Java
Changing Annotation Parameters At Runtime
Java Program to Implement Leftist Heap
Java Program to implement Sparse Vector
Vòng lặp for, while, do-while trong Java
Java Program to Implement LinkedHashSet API
Java Program to Implement Gabow Algorithm
Java Stream Filter with Lambda Expression
An Introduction to ThreadLocal in Java
Using a Mutex Object in Java
Java Program to Implement Bubble Sort
Java Program to Implement Doubly Linked List
Java Program to Solve Travelling Salesman Problem for Unweighted Graph
Java Program to Implement Circular Doubly Linked List
Java Program to Implement Disjoint Sets
New Features in Java 13
HTTP Authentification and CGI/Servlet
An Example of Load Balancing with Zuul and Eureka
Java Program to Find Basis and Dimension of a Matrix
Spring Boot with Multiple SQL Import Files
String Operations with Java Streams
Java Program to Implement Gauss Jordan Elimination
Guide to CountDownLatch in Java
Comparing Strings in Java
Java Program to Implement AVL Tree
Java Program to Implement Fisher-Yates Algorithm for Array Shuffling
Send an email using the SMTP protocol
Bootstrapping Hibernate 5 with Spring
Check If a String Is Numeric in Java