lexsort_indexer(keys, orders=None, na_position: 'str' = 'last', key: 'Callable | None' = None) -> 'npt.NDArray[np.intp]'
Sequence of ndarrays to be sorted by the indexer
Determines the sorting order for each element in keys. If a list, it must be the same length as keys. This determines whether the corresponding element in keys should be sorted in ascending (True) or descending (False) order. if bool, applied to all elements as above. if None, defaults to True.
Determines placement of NA elements in the sorted list ("last" or "first")
Callable key function applied to every element in keys before sorting
Performs lexical sorting on a set of keys
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