networkx 2.8.2 Pypi GitHub Homepage
Other Docs
NotesParametersReturns
is_pseudographical(sequence)

Every nonnegative integer sequence with an even sum is pseudographical (see ).

Notes

The worst-case run time is $O(n)$ where n is the length of the sequence.

Parameters

sequence : list or iterable container

A sequence of integer node degrees

Returns

valid : bool

True if the sequence is a pseudographic degree sequence and False if not.

Returns True if some pseudograph can realize the sequence.

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/graphical.py#278
type: <class 'function'>
Commit: