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>)

Project Activity

See All Activity >

Categories

Algorithms, Libraries

License

BSD License

Follow SwapPermutationsIterator

SwapPermutationsIterator Web Site

Other Useful Business Software
$300 Free Credits for Your Google Cloud Projects Icon
$300 Free Credits for Your Google Cloud Projects

Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.

Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Start Free Trial
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of SwapPermutationsIterator!

Additional Project Details

Intended Audience

Developers

Programming Language

Java

Related Categories

Java Algorithms, Java Libraries

Registered

2012-12-19