The radius of a graph is defined to be the minimum of the eccentricities of the vertexSet, i.e, the smallest number k such that for some vertex v, the distance between v and another vertex is less than or equal to k.
i1 : radius completeGraph 5
o1 = 1
|
i2 : radius pathGraph 5
o2 = 2
|
i3 : radius graphLibrary "dart"
o3 = 1
|