lattice_reference(G, niter=5, D=None, connectivity=True, seed=None)
The implementation is adapted from the algorithm by Sporns et al. . which is inspired from the original work by Maslov and Sneppen(2002) .
An undirected graph with 4 or more nodes.
An edge is rewired approximatively niter times.
Distance to the diagonal matrix.
Ensure connectivity for the latticized graph when set to True.
Indicator of random number generation state. See Randomness<randomness>
.
The latticized graph.
Latticize the given graph by swapping edges.
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them