diff options
Diffstat (limited to 'networkx/classes/ordered.py')
| -rw-r--r-- | networkx/classes/ordered.py | 40 |
1 files changed, 2 insertions, 38 deletions
diff --git a/networkx/classes/ordered.py b/networkx/classes/ordered.py index 89e55316..a6eedabe 100644 --- a/networkx/classes/ordered.py +++ b/networkx/classes/ordered.py @@ -1,7 +1,7 @@ """ Consistently ordered variants of the default base classes. -Note that if you are using Python 3.6, you shouldn't need these classes -because the dicts in Python 3.6 are ordered. +Note that if you are using Python 3.6+, you shouldn't need these classes +because the dicts in Python 3.6+ are ordered. Note also that there are many differing expectations for the word "ordered" and that these classes may not provide the order you expect. The intent here is to give a consistent order not a particular order. @@ -49,15 +49,6 @@ class OrderedGraph(Graph): adjlist_inner_dict_factory = OrderedDict edge_attr_dict_factory = OrderedDict - def fresh_copy(self): - """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. - """ - return OrderedGraph() - class OrderedDiGraph(DiGraph): """Consistently ordered variant of :class:`~networkx.DiGraph`.""" @@ -66,15 +57,6 @@ class OrderedDiGraph(DiGraph): adjlist_inner_dict_factory = OrderedDict edge_attr_dict_factory = OrderedDict - def fresh_copy(self): - """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. - """ - return OrderedDiGraph() - class OrderedMultiGraph(MultiGraph): """Consistently ordered variant of :class:`~networkx.MultiGraph`.""" @@ -84,15 +66,6 @@ class OrderedMultiGraph(MultiGraph): edge_key_dict_factory = OrderedDict edge_attr_dict_factory = OrderedDict - def fresh_copy(self): - """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. - """ - return OrderedMultiGraph() - class OrderedMultiDiGraph(MultiDiGraph): """Consistently ordered variant of :class:`~networkx.MultiDiGraph`.""" @@ -101,12 +74,3 @@ class OrderedMultiDiGraph(MultiDiGraph): adjlist_inner_dict_factory = OrderedDict edge_key_dict_factory = OrderedDict edge_attr_dict_factory = OrderedDict - - def fresh_copy(self): - """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. - """ - return OrderedMultiDiGraph() |