# HG changeset patch
# User Steve Losh <steve@stevelosh.com>
# Date 1478476202 0
# Node ID 23445296a0189e197f348bc1f5c0e5cb199cb530
# Parent  412a127b74190bac314618d0b9886c0457586c1f
Update README

diff -r 412a127b7419 -r 23445296a018 README.markdown
--- a/README.markdown	Sun Nov 06 23:49:16 2016 +0000
+++ b/README.markdown	Sun Nov 06 23:50:02 2016 +0000
@@ -1,1 +1,15 @@
+cl-digraph is an implementation of a mutable [directed graph][] data structure
+for Common Lisp.
+
+[directed graph]: https://en.wikipedia.org/wiki/Directed_graph
+
 * **License:** MIT/X11
+* **Documentation:** <http://sjl.bitbucket.org/cl-digraph/>
+* **Mercurial:** <http://bitbucket.org/sjl/cl-digraph/>
+* **Git:** <http://github.com/sjl/cl-digraph/>
+
+cl-digraph focuses on simplicity, correctness, and usability.  Performance is
+not *terrible*, but is not a high priority.
+
+The test suite currently passes in SBCL, CCL, ECL, and ABCL on OS X.  Further
+testing is welcome.