Author: Milan Tichavský (xticha09)
The program picks the first point from the input file, which it uses as a starting point.
Then, it performs depth-first search with backtracking to find all possible Hamiltonian cycles.
All found cycles are at first sorted and compared with already found paths, so that no duplicate
cycle is added. If the given path wasn't found yet, this path is added to the dynamic predicate
paths
.
To build and run the program using input from fully_3.in
, run
make build
./flp23-log < test-cases/fully_3.in
To launch testing script, execute
make test # execution is pretty much instant