1Null graph:
2Average shortest path length: NaN
3No. of unconnected pairs: 0
4
5Singleton graph:
6Average shortest path length: NaN
7No. of unconnected pairs: 0
8
92-vertex empty graph, unconn=true:
10Average shortest path length: NaN
11No. of unconnected pairs: 2
12
132-vertex empty graph, unconn=false:
14Average shortest path length: Inf
15No. of unconnected pairs: 2
16
17Smallest bifurcating directed tree, unconn=true:
18Average shortest path length: 1
19No. of unconnected pairs: 4
20
21Smallest bifurcating directed tree, unconn=false:
22Average shortest path length: 1
23No. of unconnected pairs: 4
24
25Undirected 11-cycle:
26Average shortest path length: 3
27No. of unconnected pairs: 0
28
29Directed 6-cycle:
30Average shortest path length: 5.5
31No. of unconnected pairs: 0
32
33De Bruijn graph, n=3 and m=5:
34Average shortest path length: 4.34405
35No. of unconnected pairs: 0
36