有没有一种方法可以递归迭代矩阵的所有可能的子矩阵，同时防止某些子矩阵被访问？

def recursive_matrix(matrix, visited, start_row, start_col, size):
    if size == 0:
        return
    
    # Check if current submatrix is visited
    if visited[start_row][start_col]:
        return

    # Mark current submatrix as visited
    visited[start_row][start_col] = True

    # Process current submatrix (e.g., print its content)
    for i in range(start_row, start_row + size):
        for j in range(start_col, start_col + size):
            print(matrix[i][j])

    # Generate next submatrix
    recursive_matrix(matrix, visited, start_row + 1, start_col, size - 1)
    recursive_matrix(matrix, visited, start_row, start_col + 1, size - 1)

# Example usage
matrix = [[1, 2, 3],
          [4, 5, 6],
          [7, 8, 9]]
n = len(matrix)
visited = [[False] * n for _ in range(n)]
recursive_matrix(matrix, visited, 0, 0, n)