#NEWLINE# def test_astar_tree_inadmissible_heuristic( self ) : #NEWLINE# #INDENT# v = TestViewer ( [ [ ( 's' , 0 ) ] , [ ( 'l' , 26 ) , ( 'a' , 15 ) ] , [ ( 'r' , 42 ) , ( 'a' , 15 ) , ( 'a' , 36 ) , ( 's' , 52 ) ] ] ) #NEWLINE# self . graph_problem . heuristic_dict = DummyGraphProblem . inadmissible #NEWLINE# result = astar ( self . graph_problem , graph_search = False , viewer = v ) #NEWLINE# self . assertEquals ( result . state , self . graph_problem . goal )