func TestAStar(t *testing.T) {
n1 := alg.NewNode()
n1.X = 1
n1.Y = 2
n2 := alg.NewNode()
n2.X = 3
n2.Y = 3
n3 := alg.NewNode()
n3.X = 4
n3.Y = 4
n4 := alg.NewNode()
n4.X = 5
n4.Y = 5
n5 := alg.NewNode()
n5.X = 10
n5.Y = 20
n1.AddAdjNode(&n2)
n1.CalcHieuristic(&n5)
n2.AddAdjNode(&n3)
n2.CalcHieuristic(&n5)
n3.AddAdjNode(&n4)
n3.CalcHieuristic(&n5)
n4.AddAdjNode(&n5)
n4.CalcHieuristic(&n5)
astar := alg.NewAStar()
astar.SetStart(&n1)
astar.SetGoal(&n5)
solution, err := astar.Solution()
if err != nil {
t.Fatal("No solution found bf A-Star path finder ")
}
if len(solution) != 5 {
t.Fatalf("The solution found was length %d but should be %d", len(solution), 5)
}
if solution[0] != &n1 {
t.Errorf("The first step in the path was not correct")
}
if solution[1] != &n2 {
t.Errorf("The second step in the path was not correct")
}
if solution[2] != &n3 {
t.Errorf("The third step in the path was not correct")
}
if solution[3] != &n4 {
t.Errorf("The fourth step in the path was not correct")
}
if solution[4] != &n5 {
t.Errorf("The fifth step in the path was not correct")
}
}
func TestNodePath(t *testing.T) {
n1 := alg.NewNode()
n2 := alg.NewNode()
n3 := alg.NewNode()
n4 := alg.NewNode()
n5 := alg.NewNode()
n2.Prev = &n1
n3.Prev = &n2
n4.Prev = &n3
n5.Prev = &n4
if len(n5.Path()) != 5 {
println(len(n5.Path()))
t.Errorf("The path was of length %i but should have been length %i", len(n5.Path()), 5)
}
}
