1Empty graph check:
2Singleton graph check:
3[        0        0 ]
4Star graph check with given root:
5[        1        0
6         0        0
7  -0.104528 0.994522
8  -0.978148 -0.207912
9  0.309017 -0.951057 ]
10Star graph check with root found by topological sort:
11[        0        0
12         1        0
13  -0.104528 0.994522
14  -0.978148 -0.207912
15  0.309017 -0.951057 ]
16Two minitrees without rootlevel:
17[ 0.642788 0.766044
18         2        0
19  -0.347296  1.96962
20  -0.34202 -0.939693
21  -1.87939 -0.68404
22         1 -1.73205 ]
23Two minitrees with rootlevel 10 and 20:
24[      5.5  9.52628
25        12        0
26        -6  10.3923
27     -10.5 -18.1865
28       -22        0
29        11 -19.0526 ]
30Graph with just loops, triple edges and disconnected vertices:
31[        1        0
32  -0.104528 0.994522
33  -0.209057  1.98904
34  -0.978148 -0.207912
35  0.309017 -0.951057 ]
36Checking proper error handling:
37Giving negative root.
38Giving negative rootlevel.
39