-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathnode.py
More file actions
87 lines (62 loc) · 2.39 KB
/
node.py
File metadata and controls
87 lines (62 loc) · 2.39 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
"""
Project Name: A* Path Finder Visualizer
Author: Utkarsh Sahu
Email: sahuuutkarhs03@gamil.com
Twitter: @Utkarsh4tech ( https://twitter.com/Utkarsh4tech )
Project Description: This is a Visualization tool for helping learners understand
about the A* algorithm. The tech Stack used in Project is
- Pygame and Python.
File Descreption: This file has the Node class and all its member functions.
"""
import pygame as pg
from colors import RED,GREEN,WHITE,BLACK,PURPLE,ORANGE,TURQUOISE
class Node:
def __init__(self,row,col,width,total_rows) -> None:
self.row=row
self.col=col
self.x=row*width
self.y=col*width
self.color=WHITE
self.neighbors=[]
self.width=width
self.total_rows=total_rows
def get_pos(self):
return self.row,self.col
def is_open(self):
return self.color == GREEN
def is_barrier(self):
return self.color == BLACK
def is_start(self):
return self.color == ORANGE
def is_end(self):
return self.color == TURQUOISE
def is_closed(self):
return self.color == RED
def make_open(self):
self.color = GREEN
def make_barrier(self):
self.color = BLACK
def make_start(self):
self.color = ORANGE
def make_end(self):
self.color = TURQUOISE
def make_closed(self):
self.color = RED
def reset(self):
self.color=WHITE
def make_path(self):
self.color=PURPLE
def draw(self,win):
pg.draw.rect(win,self.color,(self.x,self.y,self.width,self.width))
def update_neighbors(self,grid):
self.neighbors=[]
if self.row < self.total_rows -1 and not grid[self.row+1][self.col].is_barrier():
self.neighbors.append(grid[self.row+1][self.col])
if self.col < self.total_rows -1 and not grid[self.row][self.col+1].is_barrier():
self.neighbors.append(grid[self.row][self.col+1])
if self.col >0 and not grid[self.row][self.col-1].is_barrier():
self.neighbors.append(grid[self.row][self.col-1])
if self.row >0 and not grid[self.row-1][self.col].is_barrier():
self.neighbors.append(grid[self.row-1][self.col])
def __lt__(self,width):
return False