[PATCH 1 of 2] ancestor: a new algorithm for ancestors of a not in b that is faster when a and b are close
Siddharth Agarwal
sid0 at fb.com
Wed Nov 21 13:16:04 CST 2012
On 11/21/2012 08:02 AM, Benoit Boissinot wrote:
> dagparser.py?
That looks far more arcane than adjacency lists, unless there's a
built-in way to print out a nice visual representation of a DAG parsed
with parsedag().
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://selenic.com/pipermail/mercurial-devel/attachments/20121121/dee08388/attachment.html>
More information about the Mercurial-devel
mailing list