networkx 2.8.2 Pypi GitHub Homepage
Other Docs
index_satisfying(iterable, condition)

If no such element is found (that is, when the iterable is exhausted), this returns the length of the iterable (that is, one greater than the last index of the iterable).

iterable must not be empty. If iterable is empty, this function raises ValueError .

Returns the index of the first element in iterable that satisfies the given condition.

Examples

See :

Local connectivity graph

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


GitHub : /networkx/algorithms/tournament.py#39
type: <class 'function'>
Commit: