Here's the list of changes in each released version.
Added build-from-roots and build-from-leafs convenience functions to help
build digraphs when you have some roots/leafs and a way to generated their
successors/predecessors.
Added label argument to digraph.dot:draw to change the label function of the
nodes.
Added shape argument to digraph.dot:draw to change the shape of the nodes.
Added an explicit condition hierarchy.
Fixed a bug where certain kinds of cycles were not correctly detected during topological sorting.
Fixed a bug for recent SBCL versions when creating a digraph without a custom hash function.
Added the arbitrary-vertex function to return an arbitrary vertex of
a digraph.
Fixed a bug in copy-digraph.
Added rootp and leafp predicates to check whether a vertex is a root/leaf in
a digraph.
Minor internal cleanup.
If you pass an invalid strategy argument to reachablep there will now be
a restart available to supply a new value, instead of just crashing and burning.
Initial version.