Added search to pathfinding lib

Piratmac · Piratmac · commit d4348280f80c · 2020-06-20T19:00:51.000+02:00
diff --git a/2018/pathfinding.py b/2018/pathfinding.py
@@ -51,6 +51,7 @@ def grid_to_vertices (self, grid, diagonals_allowed = False, wall = '#'):
 
         :param string grid: The grid to convert
         :param Boolean diagonals_allowed: Whether diagonal movement is allowed
+        :param str wall: What is considered as a wall
         :return: True if the grid was converted
         """
         self.vertices = []
@@ -77,6 +78,28 @@ def grid_to_vertices (self, grid, diagonals_allowed = False, wall = '#'):
 
         return True
 
+    def grid_search (self, grid, items):
+        """
+        Searches the grid for some items
+
+        :param string grid: The grid to convert
+        :param Boolean items: Whether diagonal movement is allowed
+        :return: True if the grid was converted
+        """
+        items_found = {}
+        y = 0
+
+        for line in grid.splitlines():
+            for x in range(len(line)):
+                if line[x] in items:
+                    if line[x] in items_found:
+                        items_found[line[x]].append((x, y))
+                    else:
+                        items_found[line[x]] = [(x, y)]
+            y += 1
+
+        return items_found
+
     def vertices_to_grid (self, mark_coords = [], wall = '#'):
         """
         Converts a set of coordinates to a text
@@ -221,9 +244,7 @@ def topological_sort_alphabetical (self):
             not_visited.remove(next_node)
             current_distance += 1
             edges = {x:edges[x] for x in edges if x in not_visited}
-            print (not_visited, edges)
             next_node = sorted(x for x in not_visited if not x in sum(edges.values(), []))
-            print (len(next_node), next_node)
             if len(next_node):
                 next_node = next_node[0]
 
