summaryrefslogtreecommitdiff
path: root/graph.py
diff options
context:
space:
mode:
authorNicolas Chauvat <nicolas.chauvat@logilab.fr>2011-02-09 14:51:53 +0100
committerNicolas Chauvat <nicolas.chauvat@logilab.fr>2011-02-09 14:51:53 +0100
commit2b40437e2ca90dc95a3803d37857f254c04168da (patch)
tree423355ced5ebfc8b987af8926c795d1471e3c949 /graph.py
parent4b0aeb275866ec489f04cf53d2dcafed3753dbe7 (diff)
downloadlogilab-common-2b40437e2ca90dc95a3803d37857f254c04168da.tar.gz
fix the ordered_nodes fix by reverting to previous order
Diffstat (limited to 'graph.py')
-rw-r--r--graph.py7
1 files changed, 5 insertions, 2 deletions
diff --git a/graph.py b/graph.py
index ae27d45..b66f10d 100644
--- a/graph.py
+++ b/graph.py
@@ -202,11 +202,14 @@ def ordered_nodes(graph):
break
else:
deps_ok.append(node)
- order.extend(sorted(deps_ok))
+ order.append(deps_ok)
order_set |= set(deps_ok)
for node in deps_ok:
del graph[node]
- return tuple(order)
+ result = []
+ for grp in reversed(order):
+ result.extend(sorted(grp))
+ return tuple(result)
def get_cycles(graph_dict, vertices=None):