def test_shortest(self):
g = build_graph('ab ac ad bc dc')
d = {
('a', 'b'): (1, 'b'),
('a', 'c'): (1, 'c'),
('a', 'd'): (1, 'd'),
('b', 'c'): (1, 'c'),
('d', 'c'): (1, 'c')
}
g.all_pairs_shortest_path = lambda *al: d
g.is_stuck = lambda *al: False
p = planning.Goto('c')
plan = p(g, EhmNo(), 'a', '<context>')
self.assertEqual([x[0] for x in plan], ['ac', 'c'])
def test_each_in_turn(self):
g = build_graph('ab bc cd da')
d = {
('a', 'b'): (1, 'b'),
('a', 'c'): (2, 'bc'),
('a', 'd'): (3, 'bcd'),
('b', 'c'): (1, 'c'),
('b', 'd'): (2, 'cd'),
('b', 'a'): (3, 'cda'),
('c', 'd'): (1, 'd'),
('c', 'a'): (2, 'da'),
('c', 'b'): (3, 'dab'),
('d', 'a'): (1, 'a'),
('d', 'b'): (2, 'ab'),
('d', 'c'): (3, 'abc'),
}
g.all_pairs_shortest_path = lambda *al: d
g.is_stuck = lambda *al: False
p = planning.Goto(*'dcba')
plan = p(g, EhmNo(), 'a', '<context>')
self.assertEqual(
'-'.join(x[0] for x in plan),
'ab-b-bc-c-cd-d-da-a-ab-b-bc-c-cd-d-da-a-ab-b-bc-c-cd-d-da-a')
def test_ctor_smoke(self):
self.assert_(planning.Goto())