longest-path

Your algorithm has a problem. You rely on the fact that there is atmost one possible direction from any cell and that that path can never be circular. In case of a binary matrix that conditions are bound to fail. You move from (0,0) to (1,0) to (0,0) to (1,0) to (0,0) to (1,0) to … Read more