Generating combinatorial structures (with Clojure)

[FabienT]

Subject : Generating combinatorial structures (with Clojure)

Dear Clojurians,

As part of some project I had to design and implement an efficient
algorithm to generate some discrete combinatorial structure, namely
"the hasse diagram of the boolean lattice induced by the prefix
subtrees of a tree".

I tackled the problem with Clojure as my implementation language, and
converged quickly enough on an acceptable algorithm, thanks to the
high-levelness of Clojure. Functional programming certainly is a
superior ( and fun ) way of implementing algorithms.

To celebrate this modest achievement, I have posted a few diagrams
showing the trees and the intriguing structure of their induced
boolean lattices. ( See the combinatorial-structures.pdf file)

Thanks a lot Rich for Clojure.

I am sure Clojure has a brilliant future as *the* dynamic functional
programming language on the JVM, on par with Groovy on the object-
oriented side.

(The diagrams have been generated with Clojure, but formatted and
converted to gifs with the excellent yEd running on the JVM :
http://www.yworks.com/en/products_yed_about.html).

Sincerely yours,

Fabien