问Mercurial修订树的可视化

EN

#!/usr/bin/env python
from itertools import chain
import hglib
#from pygraphviz import *

repo = hglib.open('.')

log = dict((t[0], t) for t in repo.log())
def graph(): return dict((v, []) for v in log)

forward, backward, jump = (graph() for i in range(3))

for target in log:
    for parent in repo.parents(target) or []:
        source = parent[0]
        forward[source].append(target)
        backward[target].append(source)

def endpoint(v):
    if len(forward[v]) != 1: return True
    if len(backward[forward[v][0]]) != 1: return True
    if len(backward[v]) != 1: return True
    if len(forward[backward[v][0]]) != 1: return True

for v in forward:
    if endpoint(v):
        w = v
        while len(forward[w]) == 1 == len(backward[forward[w][0]]):
            w = forward[w][0]
        jump[v] = w
    else: del jump[v]

def vertex(tupl): return 'v' + tupl[1][:5]

print 'digraph {'

colors = ['red', 'green', 'blue', 'yellow', 'cyan', 'magenta',
          'orange', 'chartreuse']
authors = dict()

for v in sorted(forward, key=int):
    if not endpoint(v) or v not in jump: continue
    node = 'v%s' % v
    if jump[v] != v:
        sep = '+' if forward[v] == jump[v] else '::'
        label = '%s%s%s' % (v, sep, jump[v])
        assert int(jump[v]) > int(v)
        v = jump[v]
        del jump[v]
    else:
        label = v
    author = log[v][4]
    print '// %s' % author
    if author not in authors: authors[author] = colors[len(authors) %
                                                       len(colors)]
    attrs = dict(color=authors[author], label=label, style='bold').items()
    print '\t%s [%s]' % (node, ','.join('%s="%s"' % kv for kv in attrs))
    for w in forward[v]: print '\t%s -> v%s' % (node, w)

print '}'

python version-dag.py > log.dot ; dot -Tpdf log.dot -o log.pdf