Univerisity projects which translate a graph into a SAT problem.

The implementation was divided into 4 steps:
- check if the graph forms an Hamiltonian cicle
- print the first part of the statement
- print the second part of the statement
- print the third part of the statement

Programming Language: Java