Algorythm allows to find a shortest path in maze.
input:
....................................
..S...#......................#......
......#......................#......
.............................#......
....................................
....................................
..............#.....................
............#.......................
..........#.........................
....................................
.....................#..........#...
.....................#....X.....#...
.....................#..........#...
....................................
output: d,d,d,d,d,d,d,d,d,d,d,d,r,r,r,r,r,r,r,r,r,r,r,r,r,r,r,r,r,r,r,r,r,r,r,r,u,u,u
docker build --tag my_testtask .
docker run my_testtask:latest /bin/sh -c "mvn test"
cd pathfinder && mvn package && java -jar target/TestTask.jar maze.txt
cd pathfinder && mvn package && java -jar target/TestTask.jar < maze.txt
Algorithm has linear operation complexity: 170k ~ 3.4s 85k ~ 1.1s