hg.stevelosh.com > docs.stevelosh.com

<!DOCTYPE html>
<html>
    <head>
        <meta charset="utf-8"/>
        <title>Changelog / cl-digraph</title>
        <link rel="stylesheet" href="../_dmedia/tango.css"/>
        <link rel="stylesheet/less" type="text/css" href="../_dmedia/style.less"/>
        <script src="../_dmedia/less.js" type="text/javascript">
        </script>
    </head>
    <body class="content">
        <div class="wrap">
            <header><h1><a href="..">cl-digraph</a></h1></header>
                <div class="markdown">
<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>
<li><a href="#v131">v1.3.1</a></li>
<li><a href="#v130">v1.3.0</a></li>
<li><a href="#v121">v1.2.1</a></li>
<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="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>
<p>Added an explicit <a href="../usage#conditions">condition hierarchy</a>.</p>
<h2 id="v132">v1.3.2</h2>
<p><a href="https://github.com/sjl/cl-digraph/issues/4">Fixed a bug</a> where certain kinds of
cycles were not correctly detected during topological sorting.</p>
<h2 id="v131">v1.3.1</h2>
<p><a href="https://github.com/sjl/cl-digraph/pull/3">Fixed a bug</a> for recent SBCL versions
when creating a digraph without a custom hash function.</p>
<h2 id="v130">v1.3.0</h2>
<p>Added the <code>arbitrary-vertex</code> function to return an arbitrary vertex of
a digraph.</p>
<h2 id="v121">v1.2.1</h2>
<p>Fixed a bug in <code>copy-digraph</code>.</p>
<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
a restart available to supply a new value, instead of just crashing and burning.</p>
<h2 id="v100">v1.0.0</h2>
<p>Initial version.</p>
                </div>
            <footer><p><i>Made with Lisp and love by <a href="http://stevelosh.com/">Steve Losh</a> in Reykjavík, Iceland.</i></p></footer>
        </div>
    </body>
</html>
author	Steve Losh <steve@stevelosh.com>
date	Wed, 21 Jun 2023 15:21:12 -0400
parents	bd222fdd05e9
children	(none)