Random Euclidean edge-weighted graphs.Modify your solution to exercise4.1.43 to assign the...

Random Euclidean edge-weighted graphs.Modify your solution to exercise4.1.43 to assign the distance between vertices as each edge’s weight.

Exercise4.1.43:

Random Euclidean graphs.Write a EuclideanGraph client (see exercise 4.1.37) RandomEuclideanGraph that produces random graphs by generating Vrandom points in the unit square (xand y-coordinates between 0 and 1), then connecting each point with all points that are within a circle of radius dcentered at that point. Note: The graph will almost certainly be connected if dis larger than the threshold value and almost certainly disconnected if dis smaller than that value.

Exercise 4.1.37:

Euclidean graphs.Design and implement an API EuclideanGraph for graphs whose vertices are points in the plane that include coordinates. Include a method show() that uses StdDraw to draw the graph.