The solver reads a maze from a text file and explores it using either a stack (DFS) or queue (BFS), depending on user input. At each step, it: ...
E puer Resultater goufe verstoppt, well se eventuell net fir Iech zougänglech sinn.
Onzougänglech Resultater uweisen