docs/04-changelog.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 | (none) |