[Solved]Question 2 50 Points Write Ava Q21 10 Points Write Algorithm Randomly Generate Directed Gr Q37022711

Question 2 [50 points] WRITE IN AVA Q2.1 [10 points] Write an algorithm to randomly generate a directed graph with a given n and m and Weights[] where n is the number of vertices, m is the number of edges, and Weights[] is a list of non-negative weights for m edges Q2.2 [10 points] Use the algorithm in Q2.1 to generate three directed graphs. Each graph contains 10 vertices, and between 20-30 edges. Q2.3 [10 points] Use an API of your choice (e.g. JGraphT), visually show the three graphs you generated in Q2.2. Reference https://www.baeldung.com/igrapht Q2.4 [10 points] Write an algorithm to find the shortest path for a given vertex v in a given graph G using Dijkstra’s algorithm. Q2.5 [10 points] Use the algorithm in Q2.4 to run on the three graphs you generated in Q2.2. Visually show the shortest path from u vertex using a graph API ONE Show transcribed image text Question 2 [50 points] WRITE IN AVA Q2.1 [10 points] Write an algorithm to randomly generate a directed graph with a given n and m and Weights[] where n is the number of vertices, m is the number of edges, and Weights[] is a list of non-negative weights for m edges Q2.2 [10 points] Use the algorithm in Q2.1 to generate three directed graphs. Each graph contains 10 vertices, and between 20-30 edges. Q2.3 [10 points] Use an API of your choice (e.g. JGraphT), visually show the three graphs you generated in Q2.2. Reference https://www.baeldung.com/igrapht Q2.4 [10 points] Write an algorithm to find the shortest path for a given vertex v in a given graph G using Dijkstra’s algorithm. Q2.5 [10 points] Use the algorithm in Q2.4 to run on the three graphs you generated in Q2.2. Visually show the shortest path from u vertex using a graph API ONE

Expert Answer

---

Answer to Question 2 [50 points] WRITE IN AVA Q2.1 [10 points] Write an algorithm to randomly generate a directed graph with a giv… . . .