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:
An Intro to Spring Cloud Zookeeper
Properties with Spring and Spring Boot
File Upload with Spring MVC
Java Switch Statement
Java – Reader to Byte Array
Java Program to Implement Hash Tables with Double Hashing
Spring Boot Configuration with Jasypt
Java Program to Check whether Graph is a Bipartite using 2 Color Algorithm
Guide to Java 8’s Collectors
Format ZonedDateTime to String
Java Program to Generate All Possible Combinations Out of a, b, c, d, e
Sử dụng CyclicBarrier trong Java
Java Program to Implement Self Balancing Binary Search Tree
Java Program to Implement Triply Linked List
Join and Split Arrays and Collections in Java
Thao tác với tập tin và thư mục trong Java
A Custom Data Binder in Spring MVC
Tính đa hình (Polymorphism) trong Java
Ép kiểu trong Java (Type casting)
Introduction to Project Reactor Bus
Java Program to Find the Vertex Connectivity of a Graph
Hướng dẫn Java Design Pattern – Flyweight
Giới thiệu thư viện Apache Commons Chain
Hướng dẫn Java Design Pattern – Dependency Injection
Form Validation with AngularJS and Spring MVC
Java Program to Generate Random Partition out of a Given Set of Numbers or Characters
Tránh lỗi NullPointerException trong Java như thế nào?
Spring Boot - Build Systems
Jackson vs Gson
Java Program to Implement Gauss Jordan Elimination
Tìm hiểu cơ chế Lazy Evaluation của Stream trong Java 8
Using a Custom Spring MVC’s Handler Interceptor to Manage Sessions