42f0410204e9

--- a/cl-digraph/reference/index.html	Tue Nov 08 14:11:28 2016 +0000
+++ b/cl-digraph/reference/index.html	Sun Nov 20 15:37:57 2016 +0000
@@ -30,8 +30,10 @@
 <li><a href="#degree-out-function">DEGREE-OUT (function)</a></li>
 <li><a href="#digraph-class">DIGRAPH (class)</a></li>
 <li><a href="#edges-function">EDGES (function)</a></li>
+<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="#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>
 <li><a href="#map-depth-first-function">MAP-DEPTH-FIRST (function)</a></li>
@@ -46,6 +48,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="#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>
 <li><a href="#vertices-function">VERTICES (function)</a></li>
@@ -111,6 +114,12 @@
 
 <p>Return a fresh list of the edges of <code>digraph</code>.</p>
 <p>Each edge will be a cons of the form <code>(predecessor . successor)</code>.</p>
+<h3 id="emptyp-function"><code>EMPTYP</code> (function)</h3>
+<div class="codehilite"><pre>(EMPTYP DIGRAPH)
+</pre></div>
+
+
+<p>Return <code>t</code> if <code>digraph</code> has no vertices or edges, <code>nil</code> otherwise.</p>
 <h3 id="insert-edge-function"><code>INSERT-EDGE</code> (function)</h3>
 <div class="codehilite"><pre>(INSERT-EDGE DIGRAPH PREDECESSOR SUCCESSOR)
 </pre></div>
@@ -128,6 +137,14 @@
 <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="leafs-function"><code>LEAFS</code> (function)</h3>
+<div class="codehilite"><pre>(LEAFS DIGRAPH)
+</pre></div>
+
+
+<p>Return all leaf vertices in <code>digraph</code>.</p>
+<p>This is currently O(vertices).</p>
+<p>A root is a vertex with no outgoing edges (i.e. out-degree 0).</p>
 <h3 id="make-digraph-function"><code>MAKE-DIGRAPH</code> (function)</h3>
 <div class="codehilite"><pre>(MAKE-DIGRAPH &amp;KEY INITIAL-VERTICES (TEST #'EQL) (HASH-FUNCTION NIL))
 </pre></div>
@@ -255,6 +272,14 @@
 <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="roots-function"><code>ROOTS</code> (function)</h3>
+<div class="codehilite"><pre>(ROOTS DIGRAPH)
+</pre></div>
+
+
+<p>Return all root vertices in <code>digraph</code>.</p>
+<p>This is currently O(vertices).</p>
+<p>A root is a vertex with no incoming edges (i.e. in-degree 0).</p>
 <h3 id="successors-function"><code>SUCCESSORS</code> (function)</h3>
 <div class="codehilite"><pre>(SUCCESSORS DIGRAPH VERTEX)
 </pre></div>