The flattened image pixels.
An array of the same shape as :None:None:`image` where each pixel contains a nonzero value if it is to be considered for the filtering. NOTE: it is essential that the border pixels (those with neighbors falling outside the volume) are all set to zero, or segfaults could occur.
A list of coordinate offsets to compute the raveled coordinates of each neighbor from the raveled coordinates of the current pixel.
Output image of the same shape as the input image. The value at each pixel is the parent index of this pixel in the max-tree reprentation. This array will be written to in-place.
Output "list" of pixel indices, which contains an ordering of elements in the tree such that a parent of a pixel always comes before the element itself. More formally: i < j implies that j cannot be the the parent of i. This array will be written to in-place.
Build a max-tree.
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
