Returns True if sequence is a valid degree sequence.
A degree sequence is valid if some graph can realize it.
- sequence (list or iterable container) – A sequence of integer node degrees
- method (“eg” | “hh” (default: ‘eg’)) – The method used to validate the degree sequence. “eg” corresponds to the Erdős-Gallai algorithm, and “hh” to the Havel-Hakimi algorithm.
valid – True if the sequence is a valid degree sequence and False if not.
>>> G = nx.path_graph(4) >>> sequence = (d for n, d in G.degree()) >>> nx.is_graphical(sequence) True