.idea/.gitignore

@@ -0,0 +1,3 @@
+# Default ignored files
+/shelf/
+/workspace.xml

.idea/WALL-E.iml

@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="PYTHON_MODULE" version="4">
+  <component name="NewModuleRootManager">
+    <content url="file://$MODULE_DIR$" />
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>

.idea/inspectionProfiles/profiles_settings.xml

@@ -0,0 +1,6 @@
+<component name="InspectionProjectProfileManager">
+  <settings>
+    <option name="USE_PROJECT_PROFILE" value="false" />
+    <version value="1.0" />
+  </settings>
+</component>

.idea/misc.xml

@@ -0,0 +1,4 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectRootManager" version="2" project-jdk-name="Python 3.8" project-jdk-type="Python SDK" />
+</project>

.idea/modules.xml

@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectModuleManager">
+    <modules>
+      <module fileurl="file://$PROJECT_DIR$/.idea/WALL-E.iml" filepath="$PROJECT_DIR$/.idea/WALL-E.iml" />
+    </modules>
+  </component>
+</project>

.idea/vcs.xml

@@ -0,0 +1,6 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="VcsDirectoryMappings">
+    <mapping directory="$PROJECT_DIR$" vcs="Git" />
+  </component>
+</project>

SearchBfs.py

@@ -0,0 +1,50 @@
+class BreadthSearchAlgorithm:
+    def __init__(self, start, target):
+        self.graph = self.getData()
+        self.start = start
+        self.target = target
+
+    def bfs(self):
+        print("It's showtime")
+        can_go = [[self.start, 0]]
+        visited = []
+        visitedPrint = []
+        if self.start == self.target:
+            print("Start = Target")
+            return -1
+        while can_go != []:
+            node = can_go.pop(0)
+            if node[0] not in visited:
+                visited.append(node[0])
+                visitedPrint.append(node)
+                if node[0] == self.target:
+                    print('final')
+                    print(visitedPrint)
+                    return visited
+                neighbours = self.graph.get(node[0], [])
+                for neighbour in neighbours:
+                    can_go.append([neighbour, node[0]])
+            # print(visited)
+        return -1
+
+    def getData(self):
+        with open("data.txt", "r") as f:
+            matrix = [
+                [int(x) for x in line.split(",") if x != "\n"] for line in f.readlines()
+            ]
+        adj = {}
+        for yi, yvalue in enumerate(matrix):
+            for xi, xvalue in enumerate(matrix):
+                if xi - 1 >= 0 and matrix[yi][xi - 1] == 0:
+                    adj[(xi, yi)] = adj.get((xi, yi), []) + [(xi - 1, yi)]
+
+                if xi + 1 < len(matrix[yi]) and matrix[yi][xi + 1] == 0:
+                    adj[(xi, yi)] = adj.get((xi, yi), []) + [(xi + 1, yi)]
+
+                if yi - 1 >= 0 and matrix[yi - 1][xi] == 0:
+                    adj[(xi, yi)] = adj.get((xi, yi), []) + [(xi, yi - 1)]
+
+                if yi + 1 < len(matrix) and matrix[yi + 1][xi] == 0:
+                    adj[(xi, yi)] = adj.get((xi, yi), []) + [(xi, yi + 1)]
+
+        return adj

agent.py

@@ -1,5 +1,6 @@
 import pygame.image
 
+
 class trashmaster(pygame.sprite.Sprite):
 
     def __init__(self, x, y, img):
@@ -28,3 +29,15 @@ class trashmaster(pygame.sprite.Sprite):
         if key == pygame.K_DOWN:
             self.y += vel
         return (self.x, self.y)
+
+    def move_up(self):
+        self.y -= 64
+
+    def move_down(self):
+        self.y += 64
+
+    def move_right(self):
+        self.x += 64
+
+    def move_left(self):
+        self.x -= 64

data.txt

@@ -0,0 +1,6 @@
+0,0,0,0,0,0
+0,1,1,0,0,0
+0,1,0,0,0,0
+0,1,0,0,0,0
+0,1,0,0,0,0
+0,1,0,0,0,0

main.py

@@ -2,13 +2,17 @@ from calendar import c
 import pygame as pg
 import sys
 from os import path
+
+import SearchBfs
 from map import *
 # from agent import trashmaster
 # from house import House
 from sprites import *
 from settings import *
+from SearchBfs import *
 import math
 
+
 class Game():
 
     def __init__(self):
@@ -74,7 +78,6 @@ class Game():
         for y in range(0, HEIGHT, TILESIZE):
             pg.draw.line(self.screen, LIGHTGREY, (0, y), (WIDTH, y))
 
-
     # def draw(self, drawable_object, pos):
     #     # pos => (x, y)
     #     # drawable object must have .image field inside class
@@ -118,6 +121,7 @@ class Game():
     #      #self.screen.fill(pygame.Color(self.BACKGROUND_COLOR))
     #      self.screen.blit(self.map_img, (0,0))
 
+
 # def main():
 #     game = WalleGame()
 #     game.update_window()
@@ -147,12 +151,14 @@ class Game():
 # if __name__ == '__main__':
 #     main()
 
-
+start_node = (0, 0)
+target_node = (2, 2)
+find_path = BreadthSearchAlgorithm(start_node, target_node)
 # create the game object
 g = Game()
 g.show_start_screen()
 while True:
     g.new()
+    path_found = find_path.bfs()
     g.run()
     g.show_go_screen()
-

mapa.py

@@ -2,7 +2,6 @@ import pygame as pg
 import pytmx
 
 
-
 # config
 # TILE_SIZE = 16
 
@@ -23,7 +22,6 @@ class TiledMap:
         self.height = tm.height * tm.tileheight
         self.tmxdata = tm
 
-    
     # rendering map
     def render(self, surface):
         ti = self.tmxdata.get_tile_image_by_gid

ok

@@ -0,0 +1,8 @@
+* bfsAlgorithm
+  master
+  remotes/origin/HEAD -> origin/master
+  remotes/origin/Mapa
+  remotes/origin/agent_movement
+  remotes/origin/bfsAlgorithm
+  remotes/origin/mapa2
+  remotes/origin/master