How to implement depth-first search without recursion and if there are many ring links?

Question

Data recovery

There is a two-dimensional array and a finite number of cells next to the same data value.
need to bypass them

Answer 1

Comrade, you should be more careful with the movements of your hands. You yourself know how to restore, drill to solder, but I think you will not be able to do this. If the data is needed, take it to the SC where they can do it. Respect for honesty! )

Answer 2

Make an "index" (as in books).

Answer 3

If the recursion fails, then do not traverse in depth, but traverse in breadth (with a queue).