--- a/tests/test-ancestor.py Fri Nov 27 17:00:00 2020 -0500
+++ b/tests/test-ancestor.py Fri Nov 27 17:03:29 2020 -0500
@@ -24,13 +24,13 @@
def buildgraph(rng, nodes=100, rootprob=0.05, mergeprob=0.2, prevprob=0.7):
- '''nodes: total number of nodes in the graph
+ """nodes: total number of nodes in the graph
rootprob: probability that a new node (not 0) will be a root
mergeprob: probability that, excluding a root a node will be a merge
prevprob: probability that p1 will be the previous node
return value is a graph represented as an adjacency list.
- '''
+ """
graph = [None] * nodes
for i in xrange(nodes):
if i == 0 or rng.random() < rootprob:
@@ -228,7 +228,11 @@
print("remaining (sorted): %s" % sorted(list(revs)))
for i, (bases, revs) in enumerate(
- (({10}, {11}), ({11}, {10}), ({7}, {9, 11}),)
+ (
+ ({10}, {11}),
+ ({11}, {10}),
+ ({7}, {9, 11}),
+ )
):
print("%% missingancestors(), example %d" % (i + 1))
missanc = ancestor.incrementalmissingancestors(graph.get, bases)