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:
Hướng dẫn Java Design Pattern – Object Pool
Java Program to Check if any Graph is Possible to be Constructed for a Given Degree Sequence
ArrayList trong java
Java Program to Implement TreeSet API
Guide to the Fork/Join Framework in Java
Inject Parameters into JUnit Jupiter Unit Tests
Spring Boot - Bootstrapping
Java Program to Implement Circular Doubly Linked List
Runnable vs. Callable in Java
Java Program to Find Minimum Number of Edges to Cut to make the Graph Disconnected
Java Program to Check if an UnDirected Graph is a Tree or Not Using DFS
Java Program to Perform Polygon Containment Test
Disable Spring Data Auto Configuration
Spring Boot - Hystrix
Java Program to Implement Regular Falsi Algorithm
Java Program to Implement Bubble Sort
Java Program to Check whether Graph is Biconnected
Spring Boot - Scheduling
Java Program to Check Whether an Input Binary Tree is the Sub Tree of the Binary Tree
Java Program to Implement Fibonacci Heap
Java Program to Perform the Shaker Sort
How to Kill a Java Thread
Java toString() Method
Lớp LinkedHashMap trong Java
Template Engines for Spring
Java Program to Find Basis and Dimension of a Matrix
Display Auto-Configuration Report in Spring Boot
Introduction to Spring Boot CLI
Encode/Decode to/from Base64
Guide to java.util.concurrent.BlockingQueue
Converting a List to String in Java
Lập trình đa luồng với CompletableFuture trong Java 8