I am just starting to learn graphs…I am trying to implement a question.This question is a common one-There is a maze and there are 2 ppl in the maze- Jack and Robot…the robot can move only in all directions except the diagonal wise…there are obstacles represented by ‘|’… ’ . ’ represent a path…we have to find out whether robot can reach jack or not?

I tried to implement this one…but i think there is some-problem with my recursive function

here is my code…