1
# Copyright (C) 2005, 2006 Canonical Ltd
3
# This program is free software; you can redistribute it and/or modify
4
# it under the terms of the GNU General Public License as published by
5
# the Free Software Foundation; either version 2 of the License, or
6
# (at your option) any later version.
8
# This program is distributed in the hope that it will be useful,
9
# but WITHOUT ANY WARRANTY; without even the implied warranty of
10
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11
# GNU General Public License for more details.
13
# You should have received a copy of the GNU General Public License
14
# along with this program; if not, write to the Free Software
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17
1
from bzrlib.tests import TestCase
18
from bzrlib.graph import node_distances, nodes_by_distance, Graph
2
from bzrlib.graph import node_distances, nodes_by_distance
21
4
class TestBase(TestCase):
23
5
def edge_add(self, *args):
24
6
for start, end in zip(args[:-1], args[1:]):
25
7
if start not in self.graph:
65
47
distances = node_distances(self.graph, descendants, 'A')
66
48
self.assertEqual(distances['C'], 3)
69
class TestGraph(TestCase):
71
def test_get_descendants(self):
72
# Graph objects let you get a descendants graph in
73
# node: {direct-children:distance} which contains
74
# known children, including ghost children
76
graph.add_ghost('ghost')
77
graph.add_node('rev1', ['ghost'])
78
# check the result contains ghosts:
79
self.assertEqual({'ghost': {'rev1': 1}, 'rev1': {}},
80
graph.get_descendants())