Permalink
Commits on Apr 7, 2009
  1. v0.4

    committed Apr 7, 2009
  2. v0.3

    committed Apr 7, 2009
Commits on Mar 30, 2009
  1. Simpler queue based search.

    We now have a global channel that akts as a queue for
    breadth-first search. If computing the nodes of the tree
    is fast, then this should cause significant overhead. But if
    the main work of a program is computing the nodes then even this
    simple approach might work quite well. It should scale good because
    no thread needs to be idle until all work is done.
    committed Mar 30, 2009
Commits on Mar 19, 2009
  1. initial commit (v0.1)

    committed Mar 19, 2009