Removed unused libraries and code.
Removing unused code and libraries.
Optimized code using bit-level encoding. Created wrapper classes Polynomial and Term.
Added toString functions for Polynomial and Term.
Removed classes wrapping HashMap into Polynomial and Long into Term. No increase in performance observed.
Finished implementation using ArrayBuffer.\nAdded new systematic test function.\nSimilar performance as ListBuffer for permutations of length less than 10. After that the performance seems to increase dramatically starting with length 10 (5-20% increase).
Not all files added for some reason. Committing the rest.
Polytope algorithm implemented and compiled.
Created tests for RectTableau and fixed a few bugs. Not passing all tests yet.
Made a few tweaks and changed lpsolve version, but lpsolve still crashes.
Trying out JNA for access to lpsolve.
Committing before uploading to GitHub.
Added README.md
All but interface to LpSolve C-library implemented.
Generated JNA interface for LpSolve.
Implementation complete. Inequality calculation still does not work. Now use Java ILP interface to GLPK Java to do integer linear programming.