bfsAlgorithm #14
3
.idea/.gitignore
vendored
Normal file
3
.idea/.gitignore
vendored
Normal file
@ -0,0 +1,3 @@
|
||||
# Default ignored files
|
||||
/shelf/
|
||||
/workspace.xml
|
8
.idea/WALL-E.iml
Normal file
8
.idea/WALL-E.iml
Normal file
@ -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>
|
6
.idea/inspectionProfiles/profiles_settings.xml
Normal file
6
.idea/inspectionProfiles/profiles_settings.xml
Normal file
@ -0,0 +1,6 @@
|
||||
<component name="InspectionProjectProfileManager">
|
||||
<settings>
|
||||
<option name="USE_PROJECT_PROFILE" value="false" />
|
||||
<version value="1.0" />
|
||||
</settings>
|
||||
</component>
|
4
.idea/misc.xml
Normal file
4
.idea/misc.xml
Normal file
@ -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>
|
8
.idea/modules.xml
Normal file
8
.idea/modules.xml
Normal file
@ -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>
|
6
.idea/vcs.xml
Normal file
6
.idea/vcs.xml
Normal file
@ -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>
|
27
SearchBfs.py
Normal file
27
SearchBfs.py
Normal file
@ -0,0 +1,27 @@
|
||||
class BreadthSearchAlgorithm:
|
||||
def __init__(self, graph, start, target):
|
||||
self.graph = graph
|
||||
self.start = start
|
||||
self.target = target
|
||||
|
||||
def bfs(self):
|
||||
queue = [[self.start]]
|
||||
visited = []
|
||||
|
||||
if self.start == self.target:
|
||||
return
|
||||
|
||||
while queue:
|
||||
path = queue.pop(0)
|
||||
node = path[-1]
|
||||
if node not in visited:
|
||||
neighbours = self.graph
|
||||
for neighbour in neighbours:
|
||||
next_path = list(path)
|
||||
next_path.append(neighbour)
|
||||
queue.append(next_path)
|
||||
if neighbour == self.target:
|
||||
return next_path
|
||||
visited.append(node)
|
||||
|
||||
return
|
13
agent.py
13
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
|
||||
|
Loading…
Reference in New Issue
Block a user