ó ś£Õ\c@s[dZddlZdjdddgƒZddd gZd d „Zd „Zd „ZdS(sJGenerate graphs with a given degree sequence or expected degree sequence. i’’’’Ns sAric Hagberg (hagberg@lanl.gov)sPieter Swart (swart@lanl.gov)sYDan Schult (dschult@colgate.edu)Joel Miller (joel.c.miller.research@gmail.com)Ben Edwardstis_valid_degree_sequencet%is_valid_degree_sequence_erdos_gallait%is_valid_degree_sequence_havel_hakimithhcCsO|dkrt|ƒ}n0|dkr6t|ƒ}nd}tj|ƒ‚|S(sIReturns True if the sequence is a valid degree sequence. A degree sequence is valid if some graph can realize it. Parameters ---------- sequence : list or iterable container A sequence of integer node degrees method : "eg" | "hh" The method used to validate the degree sequence. "eg" corresponds to the Erdős-Gallai algorithm, and "hh" to the Havel-Hakimi algorithm. Returns ------- valid : bool True if the sequence is a valid degree sequence and False if not. Examples -------- >>> G = nx.path_graph(4) >>> sequence = G.degree().values() >>> nx.is_valid_degree_sequence(sequence) True References ---------- Erdős-Gallai [EG1960]_, [choudum1986]_ Havel-Hakimi [havel1955]_, [hakimi1962]_, [CL1996]_ tegRs`method` must be 'eg' or 'hh'(RRtnxtNetworkXException(tsequencetmethodtvalidtmsg((sU/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/graphical.pyRs#  cCst|ƒ}t|ƒdkr"tStjj|ƒs8tSt|ƒdkrNtSt|ƒdrbtSxŸ|r|j ƒ|ddkr‰tS|j ƒ}|dkr„tS|t|ƒkr»tSxBt t|ƒdt|ƒ|ddƒD]}||cd8s     - 7