docs/index.markdown @ a9bdea1a9564

Clean up topological-sort

We don't actually need to get the full set of minimal elements on each iteration
because we don't need to break ties.  It'll be faster (and cleaner) to just grab
the first one we find.
author Steve Losh <steve@stevelosh.com>
date Sat, 26 Mar 2016 19:30:09 +0000
parents c60cac27a0a7
children cb324d188513
Bones is a logic programming library for Common Lisp.

**Bones is still in development, don't actually try to use this for anything
yet.  It should be usable by mid-2016.**

* **License:** MIT/X11
* **Documentation:** <http://sjl.bitbucket.org/bones/>
* **Code:** <http://bitbucket.org/sjl/bones/>
* **Issues:** <http://bitbucket.org/sjl/bones/issues/>

<img src="https://i.imgur.com/EWPGAHa.gif"
     style="border: 1px solid #222; margin: 15px 0px 10px; width: 100%;"/>