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 |
fcec9e0c9c67 |
| children |
8a18f9b3bb72 |
(asdf:defsystem #:bones
:name "bones"
:description "A logic programming library for Common Lisp."
:author "Steve Losh <steve@stevelosh.com>"
:maintainer "Steve Losh <steve@stevelosh.com>"
:license "MIT/X11"
:version "0.0.1"
:depends-on (#:defstar
#:optima
#:trivial-types
#:cl-arrows
#:fare-quasiquote-optima
#:fare-quasiquote-readtable)
:serial t
:components ((:file "src/utils") ; quickutils package ordering crap
(:file "package")
(:module "src"
:components ((:file "paip")
(:module "wam"
:components ((:file "constants")
(:file "topological-sort")
(:file "cells")
(:file "wam")
(:file "instructions")
(:file "dump")
(:file "compile")))
(:file "bones")))))