Changed main function name to a_star_search

Author: pablogsal

a_star/__init__.py

@@ -1,3 +1,3 @@
 __author__ = 'Pablo Galindo Salgado'
 
-from .a_star import a_star,Node,DijkstraHeap
+from .a_star import a_star_search,Node,DijkstraHeap

a_star/a_star.py

@@ -67,7 +67,7 @@ def pop(self):
 
 Node = collections.namedtuple("Node","cost point came_from")
 
-def a_star(graph, start, end):
+def a_star_search(graph, start, end):
     """
     Calculates the shortest path from start to end.
 

examples/maze_solving_example.py

@@ -41,7 +41,7 @@ def from_id_width(point, width):
                                             (7, 3), (7, 4), (7, 5)]}
 
      # Call the A* algorithm and get the frontier
-     frontier = a_star.a_star(graph = graph, start=(1, 4), end=(7, 8))
+     frontier = a_star.a_star_search(graph = graph, start=(1, 4), end=(7, 8))
 
      # Print the results
 

tests/test_maze.py

@@ -26,7 +26,7 @@ def test_maze_1(self):
         start = (0,2)
 
         # Call the A* algorithm and get the frontier
-        frontier = a_star.a_star(graph = maze, start=start, end=end)
+        frontier = a_star.a_star_search(graph = maze, start=start, end=end)
         solution = list(backtrack(frontier.visited,start,end))
         self.assertTrue( solution == my_solution  )
 
@@ -42,7 +42,7 @@ def test_2(self):
         end = (3,1)
 
         # Call the A* algorithm and get the frontier
-        frontier = a_star.a_star(graph = maze, start=start, end=end)
+        frontier = a_star.a_star_search(graph = maze, start=start, end=end)
         maze.draw(width=3, point_to = frontier.visited, start=start, goal=end)
         maze.draw(width=3, number = frontier.costs, start=start, goal=end)
         print(frontier.visited)