dimension of the offsets to produce
whether the neighborhood should be singly- of fully-connected
Make a list of offsets from a center point defining a n-dim neighborhood.
The singly-connected 2-d neighborhood is four offsets:
This example is valid syntax, but we were not able to check execution>>> make_offsets(2, False) [(-1,0), (1,0), (0,-1), (0,1)]
While the fully-connected 2-d neighborhood is the full cartesian product of {-1, 0, 1} (less the origin (0,0)).
See :The following pages refer to to this document either explicitly or contain code examples using this.
skimage.graph._mcp.make_offsets
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