def dfs(self, visited, mat, i, j, m, n):
        visited[i][j] = True
        self.cur_area += 1
        self.max = max(self.max, self.cur_area)

        for dir in self.dirs:
            i1 = i + dir[0]
            j1 = j + dir[1]
            if 0 <= m < i1 and 0 <= j1 < n and not visited[i1][j1] and mat[i1][j1] == 1:
                self.dfs(visited, mat, i1, j1, m, n)
dataset/ETHPy150Open algorhythms/HackerRankAlgorithms/Connected Cell in a Grid.py/Solution.dfs/swapped operands of `<`