From fde384b03872ca9553619df90da9e6205e67b730 Mon Sep 17 00:00:00 2001
From: bt3gl <138340846+bt3gl-cryptographer@users.noreply.github.com>
Date: Tue, 8 Aug 2023 16:21:22 -0700
Subject: [PATCH] Update matrix_dfs_and_bfs.py

---
 graphs/matrix_dfs_and_bfs.py | 21 +--------------------
 1 file changed, 1 insertion(+), 20 deletions(-)

diff --git a/graphs/matrix_dfs_and_bfs.py b/graphs/matrix_dfs_and_bfs.py
index a4c342c..f85a251 100644
--- a/graphs/matrix_dfs_and_bfs.py
+++ b/graphs/matrix_dfs_and_bfs.py
@@ -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])):