← Back to branch summary

~bzr-pqm/bzr/bzr.dev

« back to all changes in this revision

Viewing changes to bzrlib/selftest/testgraph.py

  • Committer: aaron.bentley at utoronto
  • Date: 2005-09-05 20:22:32 UTC
  • mto: (1185.3.4)
  • mto: This revision was merged to the branch mainline in revision 1390.
  • Revision ID: aaron.bentley@utoronto.ca-20050905202231-3c83cce239fdf4c6
Implemented yet another farthest_node algorithm

Show diffs side-by-side

added added

removed removed

Lines of Context:
bzrlib/selftest/testgraph.py
1
1
from bzrlib.selftest import TestCase
2
2
from bzrlib.graph import shortest_path
3
 
from bzrlib.graph import farthest_node
 
3
from bzrlib.graph import farthest_nodes_ab
4
4
 
5
5
class TestBase(TestCase):
6
6
    def edge_add(self, *args):
26
26
        self.assertEqual(shortest_path(self.graph, 'A', 'G'), 
27
27
                         ['A', 'B', 'G'])
28
28
    def test_farthest(self):
29
 
        self.assertEqual(farthest_node(self.graph, 'A'), 'G')
 
29
        self.assertEqual(farthest_nodes_ab(self.graph, 'A')[0], 'G')
 
30
        self.assertEqual(farthest_nodes_ab(self.graph, 'F')[0], 'F')
 
31
        self.graph = {}
 
32
        self.edge_add('A', 'B', 'C', 'D')
 
33
        self.edge_add('A', 'E', 'F', 'C')
 
34
        self.edge_add('A', 'G', 'H', 'I', 'B')
 
35
        self.edge_add('A', 'J', 'K', 'L', 'M', 'N')
 
36
        self.assertEqual(farthest_nodes_ab(self.graph, 'A')[0], 'D')
 
37