This is a java program to represent graph as a linked 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 Linked 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 linked 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_Linked_List { private Map<Integer, List<Integer>> adjacencyList; public Represent_Graph_Linked_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_Linked_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_Linked_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 Linked 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_Linked_List.java $ java Represent_Graph_Linked_List Enter the number of vertices: 5 Enter the number of edges: 4 Enter the edges in the graph : <to> <from> 1 2 1 3 3 5 4 3 The Linked List Representation of the graph is: 1 -> 2 -> 3 2 -> 1 3 -> 1 -> 5 -> 4 4 -> 3 5 -> 3
Related posts:
Java – Get Random Item/Element From a List
Introduction to Spring Data MongoDB
Java Program to Implement Disjoint Sets
Creating a Generic Array in Java
Java Program to Encode a Message Using Playfair Cipher
Java Program to Check if a Given Set of Three Points Lie on a Single Line or Not
Spring 5 Functional Bean Registration
How to Get All Spring-Managed Beans?
The Java 8 Stream API Tutorial
Using a Spring Cloud App Starter
A Guide to Java SynchronousQueue
Java – Reader to String
Java 8 Predicate Chain
A Guide to TreeMap in Java
Guide to Spring @Autowired
Java Program to Find the Vertex Connectivity of a Graph
Immutable ArrayList in Java
Java Program to Implement Solovay Strassen Primality Test Algorithm
Java 8 StringJoiner
Convert Time to Milliseconds in Java
Spring MVC Async vs Spring WebFlux
Quick Guide to @RestClientTest in Spring Boot
A Guide to WatchService in Java NIO2
A Custom Media Type for a Spring REST API
A Guide to JUnit 5
Transactions with Spring and JPA
Spring Cloud Series – The Gateway Pattern
Giới thiệu Swagger – Công cụ document cho RESTfull APIs
Java Program to do a Depth First Search/Traversal on a graph non-recursively
Java Program to Find Hamiltonian Cycle in an UnWeighted Graph
Java Program to Solve the 0-1 Knapsack Problem
Spring Security 5 – OAuth2 Login