generate lazy sequences for common combinatorial functions in Clojure


math.combinatorics is a collection of efficient functional algorithms for generating lazy sequences for common combinatorial functions, like partitions, selections, cartesian products, etc. It is implemented in pure Clojure.

Upload more screenshots

Please help extend the collection of screenshots. Just make a screenshot and upload it here. You don't need to register or anything.

Upload a screenshot

Hint: upload an image here from your clipboard with Ctrl-V

Install this software package

If the package is available for the distribution you are currently using on your computer then install the software by clicking on…

Install libmath-combinatorics-clojure