Rev 3: merge_sort() can take a dictionary as the graph. in http://bzr.arbash-meinel.com/plugins/find_mainline_rev

[John Arbash Meinel]

At http://bzr.arbash-meinel.com/plugins/find_mainline_rev

------------------------------------------------------------
revno: 3
revision-id:john at arbash-meinel.com-20071101194315-2u2feiribzd3r9ie
parent: john at arbash-meinel.com-20071101193731-9k12asz8pye6b21l
committer: John Arbash Meinel <john at arbash-meinel.com>
branch nick: find_mainline_rev
timestamp: Thu 2007-11-01 14:43:15 -0500
message:
  merge_sort() can take a dictionary as the graph.
modified:
  __init__.py                    __init__.py-20071101191826-bpibqad1s9oeqw1d-1
-------------- next part --------------
=== modified file '__init__.py'
--- a/__init__.py	2007-11-01 19:37:31 +0000
+++ b/__init__.py	2007-11-01 19:43:15 +0000
@@ -31,9 +31,8 @@
     rev_graph = a_branch.repository.get_revision_graph(tip_revision_id)
     if revision_id not in rev_graph:
         return None
-    topo_sorted = tsort.merge_sort(
-        [(node, parents) for node, parents in rev_graph.iteritems()],
-        tip_revision_id, generate_revno=True)
+    topo_sorted = tsort.merge_sort(rev_graph, tip_revision_id,
+                                   generate_revno=True)
 
     last_mainline = None
     for num, rev_id, depth, dotted_revno, eo_merge in topo_sorted: