initial script
print also own id an parents
porting to python
use python3
ideas for 6
fix logic when encountering new branch
some thoughts on handling merges
integrate networkx
start working on dominance function
wrote dominance algorithm -- it is rather slow...
integrate dominance information
fix branch_counter; debug output
fix iteration order
fix branch end detection
add priority queue implementation (needed for graph traversal)
store commit timestamp
use timestamps for iteration order
fix dominance analysis; don't count 'main' branch in analysis
comment for last-commit detection logic
A Python program to implement complexity metric

It creates a bidirectional graph representing the git repository
Afterwads it computes the dominance sets for each node of the graph
Then it iterates over the graph, starting from a virtual initial commit and
choosing the yougest reachable commit of the so far visited commits
For each commit it updates the branch counter as described in the metric, using
the information from the dominance sets

Merge remote-tracking branch 'helper/master'