fix ida_star: return list of nodes instad of x-y-tuples

Author: brean

CHANGELOG.md

@@ -1,3 +1,7 @@
+# 1.0.15
+## Bugfix
+- fix for ida_star: return list of nodes instad of x-y-tuples
+
 # 1.0.14
 ## Bugfix
 - fix heuristic in a weighted graph (see #65, merges #66)

pathfinding/finder/ida_star.py

@@ -121,10 +121,7 @@ def find_path(self, start, end, grid):
             # If t is a node, it's also the end node. Route is now
             # populated with a valid path to the end node.
             if isinstance(t, Node):
-                return (
-                    [(node.x, node.y, node.grid_id) for node in path],
-                    self.runs
-                )
+                return path, self.runs
 
             # Try again, this time with a deeper cut-off. The t score
             # is the closest we got to the end node.

setup.py

@@ -11,7 +11,7 @@
     long_description=long_description,
     long_description_content_type="text/markdown",
     url="https://github.com/brean/python-pathfinding",
-    version="1.0.14",
+    version="1.0.15",
     license="MIT",
     author="Andreas Bresser",
     packages=find_packages(),