1. Implement the algorithm BFS (breadth-first search) for finding the shortest path in a labyrinth.
2. Modify the previous program to check whether a path exists between two cells without finding all possible paths. Test the program with a matrix 100x100 filled only with passable cells.