Kxvptev/labyrinth

University task, which requires breadth-first search algorithm. The idea is concluded in the searching for the shortest path in matrix filled with 1 and 0 (available path and wall) between two points. My solution based on the Lee algorithm. So, I write 1 and 0 in my matrix as -2 and -1, which helped me to calculate and write to the matrix distance from the start position to the current point

C++