This project is a result of last homework for Mathematical Methods in Computer Science class.

It contains implementation of algorithms for finding Hamiltonian Cycle on graphs with Few Inner Points, proposed by Vladimir G. Deineko et. al. in the paper The Traveling Salesman Problem with Few Inner Points.

Run built jar as: java -jar HamCycWFInnPoints.jar [CMD]

If argument CMD is set, further parameters are expected (run with "CMD help" to see help), otherwise interactive shell is started.

Class led by: prof. dr. Gašper Fijavž

Contact: Slavko Zitnik, [email protected]