# HG changeset patch
# User Steve Losh <steve@stevelosh.com>
# Date 1513637519 18000
# Node ID e5e174afc2926dc88e2f84a370f5a3002638d4a9
# Parent  0a9f79f20e20147b3a4189c19adff1688790b16f
cl-digraph: Update site.

diff -r 0a9f79f20e20 -r e5e174afc292 cl-digraph/changelog/index.html
--- a/cl-digraph/changelog/index.html	Mon Dec 18 17:46:23 2017 -0500
+++ b/cl-digraph/changelog/index.html	Mon Dec 18 17:51:59 2017 -0500
@@ -15,9 +15,13 @@
 <h1 id="changelog"><a href="">Changelog</a></h1><p>Here's the list of changes in each released version.</p>
 <div class="toc">
 <ul>
+<li><a href="#v120">v1.2.0</a></li>
 <li><a href="#v110">v1.1.0</a></li>
 <li><a href="#v100">v1.0.0</a></li>
 </ul></div>
+<h2 id="v120">v1.2.0</h2>
+<p>Added <code>rootp</code> and <code>leafp</code> predicates to check whether a vertex is a root/leaf in
+a digraph.</p>
 <h2 id="v110">v1.1.0</h2>
 <p>Minor internal cleanup.</p>
 <p>If you pass an invalid <code>strategy</code> argument to <code>reachablep</code> there will now be
diff -r 0a9f79f20e20 -r e5e174afc292 cl-digraph/index.html
--- a/cl-digraph/index.html	Mon Dec 18 17:46:23 2017 -0500
+++ b/cl-digraph/index.html	Mon Dec 18 17:51:59 2017 -0500
@@ -16,7 +16,7 @@
 for Common Lisp.</p>
 <ul>
 <li><strong>License:</strong> MIT</li>
-<li><strong>Documentation:</strong> <a href="http://sjl.bitbucket.org/cl-digraph/">http://sjl.bitbucket.org/cl-digraph/</a></li>
+<li><strong>Documentation:</strong> <a href="https://sjl.bitbucket.io/cl-digraph/">https://sjl.bitbucket.io/cl-digraph/</a></li>
 <li><strong>Mercurial:</strong> <a href="http://bitbucket.org/sjl/cl-digraph/">http://bitbucket.org/sjl/cl-digraph/</a></li>
 <li><strong>Git:</strong> <a href="http://github.com/sjl/cl-digraph/">http://github.com/sjl/cl-digraph/</a></li>
 </ul>
diff -r 0a9f79f20e20 -r e5e174afc292 cl-digraph/installation/index.html
--- a/cl-digraph/installation/index.html	Mon Dec 18 17:46:23 2017 -0500
+++ b/cl-digraph/installation/index.html	Mon Dec 18 17:51:59 2017 -0500
@@ -12,9 +12,7 @@
         <div class="wrap">
             <header><h1><a href="..">cl-digraph</a></h1></header>
                 <div class="markdown">
-<h1 id="installation"><a href="">Installation</a></h1><p>cl-digraph is compatible with Quicklisp, but not <em>in</em> Quicklisp (yet?).  You can
-clone the repository into your <a href="https://www.quicklisp.org/beta/faq.html#local-project">Quicklisp local-projects</a> directory for
-now.</p>
+<h1 id="installation"><a href="">Installation</a></h1><p>cl-digraph can be installed with <a href="https://quicklisp.org/">Quicklisp</a>: <code>(ql:quickload :cl-digraph)</code></p>
 <p>The <code>cl-digraph</code> system contains the core API and has no dependencies.</p>
 <p>The <code>cl-digraph.dot</code> system contains support for drawing digraphs with Graphviz
 using <a href="https://github.com/michaelw/cl-dot">cl-dot</a>.</p>
diff -r 0a9f79f20e20 -r e5e174afc292 cl-digraph/reference/index.html
--- a/cl-digraph/reference/index.html	Mon Dec 18 17:46:23 2017 -0500
+++ b/cl-digraph/reference/index.html	Mon Dec 18 17:51:59 2017 -0500
@@ -33,6 +33,7 @@
 <li><a href="#emptyp-function">EMPTYP (function)</a></li>
 <li><a href="#insert-edge-function">INSERT-EDGE (function)</a></li>
 <li><a href="#insert-vertex-function">INSERT-VERTEX (function)</a></li>
+<li><a href="#leafp-function">LEAFP (function)</a></li>
 <li><a href="#leafs-function">LEAFS (function)</a></li>
 <li><a href="#make-digraph-function">MAKE-DIGRAPH (function)</a></li>
 <li><a href="#map-breadth-first-function">MAP-BREADTH-FIRST (function)</a></li>
@@ -48,6 +49,7 @@
 <li><a href="#reachablep-function">REACHABLEP (function)</a></li>
 <li><a href="#remove-edge-function">REMOVE-EDGE (function)</a></li>
 <li><a href="#remove-vertex-function">REMOVE-VERTEX (function)</a></li>
+<li><a href="#rootp-function">ROOTP (function)</a></li>
 <li><a href="#roots-function">ROOTS (function)</a></li>
 <li><a href="#successors-function">SUCCESSORS (function)</a></li>
 <li><a href="#topological-sort-function">TOPOLOGICAL-SORT (function)</a></li>
@@ -137,6 +139,12 @@
 <p>Insert <code>vertex</code> into the graph if it is not already a member.</p>
 <p>Returns <code>t</code> if the vertex was already in the graph, or <code>nil</code> if it was
   inserted.</p>
+<h3 id="leafp-function"><code>LEAFP</code> (function)</h3>
+<div class="codehilite"><pre><span/>(LEAFP DIGRAPH VERTEX)
+</pre></div>
+
+
+<p>Return whether <code>vertex</code> is a leaf vertex in <code>digraph</code>.</p>
 <h3 id="leafs-function"><code>LEAFS</code> (function)</h3>
 <div class="codehilite"><pre><span/>(LEAFS DIGRAPH)
 </pre></div>
@@ -272,6 +280,12 @@
 <p>Remove <code>vertex</code> from the graph if present.</p>
 <p>If there are any edges to/from <code>vertex</code> they will be automatically removed.</p>
 <p>Returns <code>t</code> if there was such a vertex, or <code>nil</code> if not.</p>
+<h3 id="rootp-function"><code>ROOTP</code> (function)</h3>
+<div class="codehilite"><pre><span/>(ROOTP DIGRAPH VERTEX)
+</pre></div>
+
+
+<p>Return whether <code>vertex</code> is a root vertex in <code>digraph</code>.</p>
 <h3 id="roots-function"><code>ROOTS</code> (function)</h3>
 <div class="codehilite"><pre><span/>(ROOTS DIGRAPH)
 </pre></div>