Java generic Iterator implementation to generate permutations and combinations.
Uses the algorithm described here http://en.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm#Even.27s_speedup and the clear description of that algorithm here: http://www.cut-the-knot.org/Curriculum/Combinatorics/JohnsonTrotter.shtml
Features
- Iterator going through all permutations of elements in a Collection
- Iterator going through all pair wise swaps required to generate all permutations
- Iterator generating all combinations of elements in a Collection
- All strongly typed by using generic type (Iterator<T>)
License
BSD LicenseFollow SwapPermutationsIterator
Other Useful Business Software
Host LLMs in Production With On-Demand GPUs
Deploy your model, get an endpoint, pay only for compute time. No GPU provisioning or infrastructure management required.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of SwapPermutationsIterator!