Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-29 12:16:14 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update matrix_dfs_and_bfs.py

Browse Source
This commit is contained in:
bt3gl 2023-08-08 16:21:22 -07:00 committed by GitHub
parent 0f85ea546c
commit fde384b038
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
graphs/matrix_dfs_and_bfs.py
View File

@ -2,22 +2,12 @@
# -*- coding: utf-8 -*-
# author: bt3gl
'''
Given an m x n 2D binary grid grid which represents a map of
'1's (land) and '0's (water), return the number of islands.
An island is surrounded by water and is formed by connecting
adjacent lands horizontally or vertically. You may assume all
four edges of the grid are all surrounded by water.
'''
def num_island_dfs(grid) -> int:
LAND = '1'
answer = 0
#######################
### go dfs
#######################
def dfs(row, col):
if row < 0 or row >= len(grid) or col < 0 or col >= len(grid[0]) or grid[row][col] != LAND:
@ -29,15 +19,11 @@ def num_island_dfs(grid) -> int:
dfs(row, col - 1)
dfs(row, col + 1)
#######################
## loop through the board
#######################
for i in range(len(grid)):
for j in range(len(grid[0])):
if grid[i][j] == LAND:
answer += 1
dfs(i, j)
return answer
@ -48,9 +34,6 @@ def num_island_bfs(grid) -> int:
answer = 0
queue = collections.deque()
#######################
### go dfs
#######################
def bfs(row, col, queue):
delta = [(1, 0), (0, 1), (-1, 0), (0, -1)]
@ -67,9 +50,7 @@ def num_island_bfs(grid) -> int:
grid[px][py] = 'x'
queue.append((px, py))
#######################
## loop through the board
#######################
for i in range(len(grid)):
for j in range(len(grid[0])):