1
from bzrlib.selftest import TestCase
2
from bzrlib.graph import node_distances, nodes_by_distance
4
class TestBase(TestCase):
5
def edge_add(self, *args):
6
for start, end in zip(args[:-1], args[1:]):
7
if start not in self.graph:
9
if end not in self.graph:
11
self.graph[start][end] = 1
16
self.edge_add('A', 'B', 'C', 'D')
17
self.edge_add('A', 'E', 'F', 'C')
18
self.edge_add('A', 'G', 'H', 'I', 'B')
19
self.edge_add('A', 'J', 'K', 'L', 'M', 'N')
20
self.edge_add('O', 'N')
22
def node_descendants(self):
23
descendants = {'A':set()}
24
for node in self.graph:
25
for ancestor in self.graph[node]:
26
if ancestor not in descendants:
27
descendants[ancestor] = set()
28
descendants[ancestor].add(node)
31
def test_distances(self):
32
descendants = self.node_descendants()
33
distances = node_distances(self.graph, descendants, 'A')
34
nodes = nodes_by_distance(distances)
35
self.assertEqual(nodes[0], 'D')
36
assert nodes[1] in ('N', 'C')
37
assert nodes[2] in ('N', 'C')
38
assert nodes[3] in ('B', 'M')
39
assert nodes[4] in ('B', 'M')
41
#Ensure we don't shortcut through B when there's only a difference of
44
self.edge_add('A', 'B', 'C')
45
self.edge_add('A', 'D', 'E', 'C')
46
descendants = self.node_descendants()
47
distances = node_distances(self.graph, descendants, 'A')
48
self.assertEqual(distances['C'], 3)
added
removed
bzrlib/selftest/testgraph.py
