ó ŸÃÒYc@sÑdZddlmZddlmZddlmZddlmZddl m Z gZ e j dd d d gƒdefd „ƒYZ d efd „ƒYZd efd„ƒYZd e fd„ƒYZdS(s Consistently ordered variants of the default base classes. The Ordered (Di/Multi/MultiDi) Graphs give a consistent order for reporting of nodes and edges. The order of node reporting agrees with node adding, but for edges, the order is not necessarily the order that the edges were added. In general, you should use the default (i.e., unordered) graph classes. However, there are times (e.g., when testing) when you may need the order preserved. iÿÿÿÿ(t OrderedDicti(tGraph(t MultiGraph(tDiGraph(t MultiDiGrapht OrderedGraphtOrderedDiGraphtOrderedMultiGraphtOrderedMultiDiGraphcBs/eZdZeZeZeZeZd„ZRS(s9Consistently ordered variant of :class:`~networkx.Graph`.cCstƒS(s Return a fresh copy graph with the same data structure. A fresh copy has no nodes, edges or graph attributes. It is the same data structure as the current graph. This method is typically used to create an empty version of the graph. (R(tself((sn/private/var/folders/w6/vb91730s7bb1k90y_rnhql1dhvdd44/T/pip-build-w4MwvS/networkx/networkx/classes/ordered.pyt fresh_copy$s( t__name__t __module__t__doc__Rtnode_dict_factorytadjlist_outer_dict_factorytadjlist_inner_dict_factorytedge_attr_dict_factoryR (((sn/private/var/folders/w6/vb91730s7bb1k90y_rnhql1dhvdd44/T/pip-build-w4MwvS/networkx/networkx/classes/ordered.pyRs cBs/eZdZeZeZeZeZd„ZRS(s;Consistently ordered variant of :class:`~networkx.DiGraph`.cCstƒS(s Return a fresh copy graph with the same data structure. A fresh copy has no nodes, edges or graph attributes. It is the same data structure as the current graph. This method is typically used to create an empty version of the graph. (R(R ((sn/private/var/folders/w6/vb91730s7bb1k90y_rnhql1dhvdd44/T/pip-build-w4MwvS/networkx/networkx/classes/ordered.pyR 5s( R R R RRRRRR (((sn/private/var/folders/w6/vb91730s7bb1k90y_rnhql1dhvdd44/T/pip-build-w4MwvS/networkx/networkx/classes/ordered.pyR.s cBs5eZdZeZeZeZeZeZd„Z RS(s>Consistently ordered variant of :class:`~networkx.MultiGraph`.cCstƒS(s Return a fresh copy graph with the same data structure. A fresh copy has no nodes, edges or graph attributes. It is the same data structure as the current graph. This method is typically used to create an empty version of the graph. (R(R ((sn/private/var/folders/w6/vb91730s7bb1k90y_rnhql1dhvdd44/T/pip-build-w4MwvS/networkx/networkx/classes/ordered.pyR Gs( R R R RRRRtedge_key_dict_factoryRR (((sn/private/var/folders/w6/vb91730s7bb1k90y_rnhql1dhvdd44/T/pip-build-w4MwvS/networkx/networkx/classes/ordered.pyR?scBs5eZdZeZeZeZeZeZd„Z RS(s@Consistently ordered variant of :class:`~networkx.MultiDiGraph`.cCstƒS(s Return a fresh copy graph with the same data structure. A fresh copy has no nodes, edges or graph attributes. It is the same data structure as the current graph. This method is typically used to create an empty version of the graph. (R(R ((sn/private/var/folders/w6/vb91730s7bb1k90y_rnhql1dhvdd44/T/pip-build-w4MwvS/networkx/networkx/classes/ordered.pyR Ys( R R R RRRRRRR (((sn/private/var/folders/w6/vb91730s7bb1k90y_rnhql1dhvdd44/T/pip-build-w4MwvS/networkx/networkx/classes/ordered.pyRQsN(R t collectionsRtgraphRt multigraphRtdigraphRt multidigraphRt__all__textendRRRR(((sn/private/var/folders/w6/vb91730s7bb1k90y_rnhql1dhvdd44/T/pip-build-w4MwvS/networkx/networkx/classes/ordered.pyt s