# HG changeset patch
# User Steve Losh <steve@stevelosh.com>
# Date 1687375272 14400
# Node ID 15d3b832fdc5c7c7c4c0e9eff7ab45da00ba538a
# Parent  bd222fdd05e9ff44a075f1db98cb80889a42f7a4
cl-digraph: Update site.

diff -r bd222fdd05e9 -r 15d3b832fdc5 cl-digraph/changelog/index.html
--- a/cl-digraph/changelog/index.html	Wed Feb 08 21:41:35 2023 -0500
+++ b/cl-digraph/changelog/index.html	Wed Jun 21 15:21:12 2023 -0400
@@ -15,6 +15,7 @@
 <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="#v160">v1.6.0</a></li>
 <li><a href="#v150">v1.5.0</a></li>
 <li><a href="#v140">v1.4.0</a></li>
 <li><a href="#v132">v1.3.2</a></li>
@@ -25,6 +26,12 @@
 <li><a href="#v110">v1.1.0</a></li>
 <li><a href="#v100">v1.0.0</a></li>
 </ul></div>
+<h2 id="v160">v1.6.0</h2>
+<p>Added <code>build-from-roots</code> and <code>build-from-leafs</code> convenience functions to help
+build digraphs when you have some roots/leafs and a way to generated their
+successors/predecessors.</p>
+<p>Added <code>label</code> argument to <code>digraph.dot:draw</code> to change the label function of the
+nodes.</p>
 <h2 id="v150">v1.5.0</h2>
 <p>Added <code>shape</code> argument to <code>digraph.dot:draw</code> to change the shape of the nodes.</p>
 <h2 id="v140">v1.4.0</h2>
diff -r bd222fdd05e9 -r 15d3b832fdc5 cl-digraph/reference-dot/index.html
--- a/cl-digraph/reference-dot/index.html	Wed Feb 08 21:41:35 2023 -0500
+++ b/cl-digraph/reference-dot/index.html	Wed Jun 21 15:21:12 2023 -0400
@@ -23,7 +23,8 @@
 </ul></div>
 <h2 id="package-digraphdot">Package <code>DIGRAPH.DOT</code></h2>
 <h3 id="draw-function"><code>DRAW</code> (function)</h3>
-<div class="codehilite"><pre><span/>(DRAW DIGRAPH &amp;KEY (FILENAME digraph.png) (FORMAT :PNG) (SHAPE :CIRCLE))
+<div class="codehilite"><pre><span/>(DRAW DIGRAPH &amp;KEY (FILENAME digraph.png) (FORMAT :PNG) (SHAPE :CIRCLE)
+      (LABEL #'PRINC-TO-STRING))
 </pre></div>
 
 
diff -r bd222fdd05e9 -r 15d3b832fdc5 cl-digraph/reference/index.html
--- a/cl-digraph/reference/index.html	Wed Feb 08 21:41:35 2023 -0500
+++ b/cl-digraph/reference/index.html	Wed Jun 21 15:21:12 2023 -0400
@@ -21,6 +21,8 @@
 <ul>
 <li><a href="#package-digraph">Package DIGRAPH</a><ul>
 <li><a href="#arbitrary-vertex-function">ARBITRARY-VERTEX (function)</a></li>
+<li><a href="#build-from-leafs-function">BUILD-FROM-LEAFS (function)</a></li>
+<li><a href="#build-from-roots-function">BUILD-FROM-ROOTS (function)</a></li>
 <li><a href="#contains-edge-p-function">CONTAINS-EDGE-P (function)</a></li>
 <li><a href="#contains-vertex-p-function">CONTAINS-VERTEX-P (function)</a></li>
 <li><a href="#copy-digraph-function">COPY-DIGRAPH (function)</a></li>
@@ -72,6 +74,28 @@
 
 <p>Return an arbitrary vertex of <code>digraph</code> and <code>t</code>.</p>
 <p>If the digraph is empty, <code>(values nil nil)</code> will be returned instead.</p>
+<h3 id="build-from-leafs-function"><code>BUILD-FROM-LEAFS</code> (function)</h3>
+<div class="codehilite"><pre><span/>(BUILD-FROM-LEAFS LEAFS PREDECESSOR-FUNCTION &amp;KEY (TEST #'EQL) (HASH-FUNCTION NIL))
+</pre></div>
+
+
+<p>Build a fresh <code>digraph</code> starting from <code>leafs</code> using <code>predecessor-function</code>.</p>
+<p>This is a convenience function to build a digraph object if you have some
+  leafs and a function that can find their parents.</p>
+<p><code>leafs</code> must be a list.</p>
+<p><code>predecessor-function</code> must be a function that takes a vertex and returns
+  a list of its predecessors.</p>
+<h3 id="build-from-roots-function"><code>BUILD-FROM-ROOTS</code> (function)</h3>
+<div class="codehilite"><pre><span/>(BUILD-FROM-ROOTS ROOTS SUCCESSOR-FUNCTION &amp;KEY (TEST #'EQL) (HASH-FUNCTION NIL))
+</pre></div>
+
+
+<p>Build a fresh <code>digraph</code> starting from <code>roots</code> using <code>successor-function</code>.</p>
+<p>This is a convenience function to build a digraph object if you have some
+  roots and a function that can find their children.</p>
+<p><code>roots</code> must be a list.</p>
+<p><code>successor-function</code> must be a function that takes a vertex and returns a list
+  of its successors.</p>
 <h3 id="contains-edge-p-function"><code>CONTAINS-EDGE-P</code> (function)</h3>
 <div class="codehilite"><pre><span/>(CONTAINS-EDGE-P DIGRAPH PREDECESSOR SUCCESSOR)
 </pre></div>