double clusteringCoefficient(anyType v) double clusteringCoefficient() double averagePathLength() GenericLink<anyType> breadthFirstSearch(anyType source)It is okay to add other methods that you consider useful. Ignore Items (2) and (6) in the Implementation section of Project 1 handout.
public static myListGraphto construct an appropriate small world graph. This is similar to the method createUDG in the posted version of the SmallWorldGraph class.
createSmallWorldGraph(int n, int d, double p)
public smallWorldGraph(int n, int d, double p)This is similar to the constructor
public unitDiskGraph(int n, int d)in the posted version of the unit Disk Graph class.