grid_2d_graph(m, n, periodic=False, create_using=None)
The grid graph has each node connected to its four nearest neighbors.
If an integer, nodes are from :None:None:`range(n)`. If a container, elements become the coordinate of the nodes.
If periodic
is True, both dimensions are periodic. If False, none are periodic. If periodic
is iterable, it should yield 2 bool values indicating whether the 1st and 2nd axes, respectively, are periodic.
Graph type to create. If graph instance, then cleared before populated.
The (possibly periodic) grid graph of the specified dimensions.
Returns the two-dimensional grid graph.
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.connectivity.kcutsets.all_node_cuts
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