Here's the iterative version of the code using a queue for Breadth-First Search (BFS) instead of recursion:

from collections import deque



class Solution:

    def hasCycle(self, matrix):

        rows = len(matrix)

        cols = len(matrix[0])

      ...