This is a java program to generate a random graph by generating random number of edges. One important thing to note here is, that we need to decide minimum and maximum number of nodes such that all edges get accommodated. Minimum number of vertices is positive solution to n(n-1) = 2e, where e is number of edges and maximum number of vertices is e+1.
Here is the source code of the Java Program to Create a Random Graph Using Random Edge Generation. 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 generate a random graph using random edge generation import java.util.HashMap; import java.util.LinkedList; import java.util.List; import java.util.Map; import java.util.Random; import java.util.Scanner; public class Random_Edges_Graph { private Map<Integer, List<Integer>> adjacencyList; public Random_Edges_Graph(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[]) { System.out.println("Enter the number of edges: "); Scanner sc = new Scanner(System.in); int e = sc.nextInt(); try { int minV = (int) Math.ceil((1 + Math.sqrt(1 + 8 * e)) / 2); int maxV = e + 1; Random random = new Random(); int v = Math.abs(random.nextInt(maxV - minV) + minV); System.out.println("Random graph has "+v+" vertices"); Random_Edges_Graph reg = new Random_Edges_Graph(v); int count = 1, to, from; while (count <= e) { to = Math.abs(random.nextInt(v + 1 - 1) + 1); from = Math.abs(random.nextInt(v + 1 - 1) + 1); reg.setEdge(to, from); count++; } System.out .println("THe Adjacency List Representation of the random graph is: "); for (int i = 1; i <= v; i++) { System.out.print(i + " -> "); List<Integer> edgeList = reg.getEdge(i); if (edgeList.size() == 0) System.out.print("null"); else { 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 Random_Edges_Graph.java $ java Random_Edges_Graph Enter the number of edges: 5 Random graph has 4 vertices THe Adjacency List Representation of the random graph is: 1 -> 4 -> 4 2 -> 3 -> 3 3 -> 2 -> 4 -> 2 4 -> 1 -> 1 -> 3
Related posts:
REST Pagination in Spring
Java Program to Implement Tarjan Algorithm
Java Program to Find SSSP (Single Source Shortest Path) in DAG (Directed Acyclic Graphs)
Introduction to Spring Cloud Rest Client with Netflix Ribbon
Spring RequestMapping
Ignore Null Fields with Jackson
Java Program to Implement Knapsack Algorithm
The Difference Between Collection.stream().forEach() and Collection.forEach()
So sánh HashMap và Hashtable trong Java
Registration – Activate a New Account by Email
Mảng (Array) trong Java
Java Program to Implement Graph Structured Stack
Java Program to Represent Graph Using Linked List
Java Program to Implement Binary Search Tree
Java Program to Perform Searching Based on Locality of Reference
Logging a Reactive Sequence
Java Program to Perform Polygon Containment Test
The SpringJUnitConfig and SpringJUnitWebConfig Annotations in Spring 5
TreeSet và sử dụng Comparable, Comparator trong java
Guide to java.util.Formatter
Java Program to Check the Connectivity of Graph Using BFS
Java Program to Implement Best-First Search
Guide to ThreadLocalRandom in Java
Lấy ngày giờ hiện tại trong Java
Xây dựng ứng dụng Client-Server với Socket trong Java
Spring REST API + OAuth2 + Angular (using the Spring Security OAuth legacy stack)
Tạo ứng dụng Java RESTful Client với thư viện OkHttp
The Difference Between map() and flatMap()
Using JWT with Spring Security OAuth (legacy stack)
Reading an HTTP Response Body as a String in Java
Java Program to Implement the RSA Algorithm
Spring Cloud AWS – EC2