fix visualization for IDA*

Author: brean

CHANGELOG.md

@@ -1,6 +1,10 @@
+# 1.0.16
+## Bugfix
+- fix for ida_star: visualize all visited nodes, not just the last one.
+
 # 1.0.15
 ## Bugfix
-- fix for ida_star: return list of nodes instad of x-y-tuples
+- fix for ida_star: return list of nodes instead of x-y-tuples
 
 # 1.0.14
 ## Bugfix

pathfinding/finder/ida_star.py

@@ -32,6 +32,7 @@ def __init__(self, heuristic=None, weight=1,
             weighted=False,
             time_limit=time_limit,
             max_runs=max_runs)
+        self.nodes_visited = 0
         self.track_recursion = track_recursion
         if not heuristic:
             if diagonal_movement == DiagonalMovement.never:
@@ -70,8 +71,10 @@ def search(self, node, g, cutoff, path, depth, end, grid):
         #    sorted(neighbors, sort_neighbors)
         min_t = float('inf')
         for neighbor in neighbors:
+            neighbor.opened = True
+
             if self.track_recursion:
-                # Retain a copy for visualisation. Due to recursion, this
+                # Retain a copy for visualization. Due to recursion, this
                 # node may be part of other paths too.
                 neighbor.retain_count += 1
                 neighbor.tested = True
@@ -85,12 +88,6 @@ def search(self, node, g, cutoff, path, depth, end, grid):
                 path[depth] = node
                 return t
 
-            # Decrement count, then determine whether it's actually closed.
-            if self.track_recursion:
-                neighbor.retain_count -= 1
-                if neighbor.retain_count == 0:
-                    neighbor.tested = False
-
             if t < min_t:
                 min_t = t
 

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.15",
+    version="1.0.16",
     license="MIT",
     author="Andreas Bresser",
     packages=find_packages(),