Java undirected connected graph program :
part 1) Write an algorithm to randomly generated an undirectedconnected graph with a given n vertices and m edges.
part 2) Using the algorithm in part 1, generate three undirectedconnected graphs. Each graph must contain 10 vertices and between20-30 edges.
part 3) Use an API such as JGraphT, to visually show the threegraphs generated from part 2.
part 4) Write an algorithm to return 3 cycles in a givengraph.
part 5) Run the algorithm from part 4 on the three graphsgenerated from part 2. Show the result of the circles visually.
Answer