* hamilton cycle dynamic programming solution in O(2^n*n) time and memory for n <= 20(n is number of vertices)
* tests added in hamilton-cycle
* stylistical fixes
* endline added
* assert for tests added
* some more fixes delete replaced with delete[] and comment extended od main function
* comments added like about author
* file descriptions added in hamiltons-cycle.cpp
* fix code per standards
* fix filename per repo standards
* code optimized
* updating DIRECTORY.md
* fixes: docs + optimization
* fix pre
* update main function docs
* move file from dynamic_programming to more appropriate graph
* updating DIRECTORY.md
* fix filename
* updating DIRECTORY.md
Co-authored-by: vakhokoto <v.kotoreishvili@gmail.com>
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
