Empty graph.
[ 0-by-2 ]
[ 0-by-3 ]
Singleton graph in a box.
Two connected vertices.
Two connected vertices in a box.
P_3 graph.
P_4 graph.
A few tests with a disconnected graph of 10 vertices with loops in a box from -1 to 1.
Without weights or bounds.
With weights.
With weights, bounds, and high kkconst.
With weights, bounds, and low kkconst.
With weights, bounds, and high kkconst and seed.
Full graph of 5 vertices, seed and no iterations:
[      0.1      0.2
       0.3      0.4
       0.5      0.6
       0.7      0.8
       0.9        1 ]
