1No vertices:
2Result:      NaN
3Unconnected pairs:        0
4
5One vertex:
6Result:      NaN
7Unconnected pairs:        0
8
9Two vertices:
10Result:      NaN
11Unconnected pairs:        2
12
13Two vertices, inf for unconnected pairs:
14Result:      Inf
15Unconnected pairs:        2
16
17Smallest bifurcating directed tree:
18Result:        1
19Unconnected pairs:        4
20
21Smallest bifurcating directed tree, inf for unconnected pairs:
22Result:      Inf
23Unconnected pairs:        4
24
25Graph with loops and multiple edges:
26Result:        5
27Unconnected pairs:       19
28
29Graph with loops and multiple edges, ignoring direction:
30Result:      4.6
31Unconnected pairs:       10
32
33Checking incorrect weight length error handling.
34Checking negative weight error handling.
35