Travelling Salesman Problem, dynamic progr Held-Karp algorithm  (part2, task 5).

Well-tested and works fine on smaller graphs (testing graph has 5 points),
but on larger graphs (25 points) eats up my 2 Gigs of RAM half-way.
Needs memory usage optimizations.
Travelling Salesman Problem, datasets
Travelling Salesman Problem, dynamic progr Held-Karp algorithm  (part2, task 5).
Improved objects managements, removing unused objects. Better memory usage.
Ensured that all bitwise operations are performed on integers, and not "100101" strings
Travelling salesman MAJOR rewrite to use Arrays instead of Hashes