d4e05a2c0f01

--- a/cl-digraph/reference/index.html	Tue Nov 08 13:05:32 2016 +0000
+++ b/cl-digraph/reference/index.html	Tue Nov 08 14:11:28 2016 +0000
@@ -43,6 +43,7 @@
 <li><a href="#mapc-vertices-function">MAPC-VERTICES (function)</a></li>
 <li><a href="#neighbors-function">NEIGHBORS (function)</a></li>
 <li><a href="#predecessors-function">PREDECESSORS (function)</a></li>
+<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="#successors-function">SUCCESSORS (function)</a></li>
@@ -228,6 +229,17 @@
 
 
 <p>Return a fresh list of the predecessors of <code>vertex</code>.</p>
+<h3 id="reachablep-function"><code>REACHABLEP</code> (function)</h3>
+<div class="codehilite"><pre>(REACHABLEP DIGRAPH START TARGET &amp;KEY (STRATEGY :BREADTH-FIRST))
+</pre></div>
+
+
+<p>Return <code>t</code> if it is possible to reach <code>target</code> from <code>start</code>, otherwise <code>nil</code>.</p>
+<p>All vertices are reachable from themselves.</p>
+<p>Otherwise a <code>target</code> is reachable from <code>start</code> if a directed path exists from
+  the start to the target.</p>
+<p><code>strategy</code> will be used to determine how to traverse the graph when searching
+  for a path, and can be one of <code>:breadth-first</code> or <code>:depth-first</code>.</p>
 <h3 id="remove-edge-function"><code>REMOVE-EDGE</code> (function)</h3>
 <div class="codehilite"><pre>(REMOVE-EDGE DIGRAPH PREDECESSOR SUCCESSOR)
 </pre></div>