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:
Receive email using IMAP
Immutable Map Implementations in Java
Java Program to Implement Fenwick Tree
OAuth2 Remember Me with Refresh Token
Java Program to Construct an Expression Tree for an Postfix Expression
Converting a Stack Trace to a String in Java
Java Program to Implement Singly Linked List
Java Program to Implement LinkedHashSet API
Exploring the Spring 5 WebFlux URL Matching
Zipping Collections in Java
A Guide to Queries in Spring Data MongoDB
Serialization và Deserialization trong java
Java Program to Implement Double Ended Queue
Java TreeMap vs HashMap
Java Program to Perform Left Rotation on a Binary Search Tree
Java Program to Implement Extended Euclid Algorithm
Using a List of Values in a JdbcTemplate IN Clause
Java Program to Check if any Graph is Possible to be Constructed for a Given Degree Sequence
Sử dụng CyclicBarrier trong Java
TreeSet và sử dụng Comparable, Comparator trong java
Java Program to Implement the One Time Pad Algorithm
Logout in an OAuth Secured Application
Java Program to Apply Above-Below-on Test to Find the Position of a Point with respect to a Line
Converting a List to String in Java
Java Program to Generate All Subsets of a Given Set in the Gray Code Order
Java Program to Implement ScapeGoat Tree
Java Program to Implement Repeated Squaring Algorithm
Creating Docker Images with Spring Boot
Java Program to Perform Postorder Recursive Traversal of a Given Binary Tree
Java Program to implement Circular Buffer
Functional Interfaces in Java 8
Spring RequestMapping