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:
Spring Boot: Customize Whitelabel Error Page
Java Program for Douglas-Peucker Algorithm Implementation
Lớp Collectors trong Java 8
Validations for Enum Types
Spring Boot - Database Handling
Java Program to Implement Floyd-Warshall Algorithm
Setting a Request Timeout for a Spring REST API
Java Program to Implement Park-Miller Random Number Generation Algorithm
Returning Image/Media Data with Spring MVC
Java Program to Implement LinkedBlockingDeque API
Checked and Unchecked Exceptions in Java
Tính đa hình (Polymorphism) trong Java
Overview of Spring Boot Dev Tools
Getting a File’s Mime Type in Java
Spring Boot - Creating Docker Image
How to Replace Many if Statements in Java
Java Program to Implement Knapsack Algorithm
Spring MVC Custom Validation
Java Program to Implement Bellman-Ford Algorithm
Java Program to Implement a Binary Search Algorithm for a Specific Search Sequence
Spring Boot: Customize the Jackson ObjectMapper
Java Program to Check if a Matrix is Invertible
So sánh HashMap và Hashtable trong Java
Spring Data Reactive Repositories with MongoDB
DynamoDB in a Spring Boot Application Using Spring Data
Java Program to Implement Pagoda
Tránh lỗi NullPointerException trong Java như thế nào?
Java Program to Implement Shunting Yard Algorithm
Java Program to Implement Ford–Fulkerson Algorithm
Spring Boot Gradle Plugin
Spring Boot Annotations
How to Get a Name of a Method Being Executed?