I am trying to create a maze solver in python using the Breadth-first search. The algorith is supposed to replace the shortest path from S to E (start to end) with 1\'s. How