My program is more advanced than LCA. It uses BFS and could work on arbitrary graphs. Could somebody help with this test? I know that if there is no bug with my program then there is a problem with connectivity of graph from start point to end point.

Check for cases when start = end.

also don't use incorrect comparison. for example:

newPoint = point+delta

if(0<=newPoint && newPoint<w*h)