Updated documentation for commit 6dd2205627cd524894b1175da20ce9c5ac65aef7

1 files changed, 15 insertions, 15 deletions

diff --git a/graph-api.html b/graph-api.html
index afecfcc9..c9b15eee 100644
--- a/graph-api.html
+++ b/graph-api.html
@@ -34,7 +34,7 @@ namespace.
     <a class="wiki_link" href="api-index.html">API Index</a><br />
     <a class="wiki_link" href="#">Namespaces:</a>
     <ul id="left-sidebar-list">
-      <li><a href="accumulators-api.html" class="wiki_link">accumulators</a></li><li><a href="agent-utils-api.html" class="wiki_link">agent-utils</a></li><li><a href="classpath-api.html" class="wiki_link">classpath</a></li><li><a href="combinatorics-api.html" class="wiki_link">combinatorics</a></li><li><a href="command-line-api.html" class="wiki_link">command-line</a></li><li><a href="complex-numbers-api.html" class="wiki_link">complex-numbers</a></li><li><a href="cond-api.html" class="wiki_link">cond</a></li><li><a href="condition-api.html" class="wiki_link">condition</a></li><li><a href="core-api.html" class="wiki_link">core</a></li><li><a href="dataflow-api.html" class="wiki_link">dataflow</a></li><li><a href="datalog-api.html" class="wiki_link">datalog</a></li><li><a href="def-api.html" class="wiki_link">def</a></li><li><a href="duck-streams-api.html" class="wiki_link">duck-streams</a></li><li><a href="error-kit-api.html" class="wiki_link">error-kit</a></li><li><a href="except-api.html" class="wiki_link">except</a></li><li><a href="fcase-api.html" class="wiki_link">fcase</a></li><li><a href="find-namespaces-api.html" class="wiki_link">find-namespaces</a></li><li><a href="fnmap-api.html" class="wiki_link">fnmap</a></li><li><a href="gen-html-docs-api.html" class="wiki_link">gen-html-docs</a></li><li><a href="generic.arithmetic-api.html" class="wiki_link">generic.arithmetic</a></li><li><a href="generic.collection-api.html" class="wiki_link">generic.collection</a></li><li><a href="generic.comparison-api.html" class="wiki_link">generic.comparison</a></li><li><a href="generic.functor-api.html" class="wiki_link">generic.functor</a></li><li><a href="generic.math-functions-api.html" class="wiki_link">generic.math-functions</a></li><li><a href="graph-api.html" class="wiki_link">graph</a></li><li><a href="greatest-least-api.html" class="wiki_link">greatest-least</a></li><li><a href="http.agent-api.html" class="wiki_link">http.agent</a></li><li><a href="http.connection-api.html" class="wiki_link">http.connection</a></li><li><a href="import-static-api.html" class="wiki_link">import-static</a></li><li><a href="jar-api.html" class="wiki_link">jar</a></li><li><a href="java-utils-api.html" class="wiki_link">java-utils</a></li><li><a href="javadoc.browse-api.html" class="wiki_link">javadoc.browse</a></li><li><a href="json.read-api.html" class="wiki_link">json.read</a></li><li><a href="json.write-api.html" class="wiki_link">json.write</a></li><li><a href="lazy-seqs-api.html" class="wiki_link">lazy-seqs</a></li><li><a href="lazy-xml-api.html" class="wiki_link">lazy-xml</a></li><li><a href="logging-api.html" class="wiki_link">logging</a></li><li><a href="macro-utils-api.html" class="wiki_link">macro-utils</a></li><li><a href="macros-api.html" class="wiki_link">macros</a></li><li><a href="map-utils-api.html" class="wiki_link">map-utils</a></li><li><a href="math-api.html" class="wiki_link">math</a></li><li><a href="miglayout-api.html" class="wiki_link">miglayout</a></li><li><a href="mmap-api.html" class="wiki_link">mmap</a></li><li><a href="monadic-io-streams-api.html" class="wiki_link">monadic-io-streams</a></li><li><a href="monads-api.html" class="wiki_link">monads</a></li><li><a href="ns-utils-api.html" class="wiki_link">ns-utils</a></li><li><a href="pprint-api.html" class="wiki_link">pprint</a></li><li><a href="probabilities.finite-distributions-api.html" class="wiki_link">probabilities.finite-distributions</a></li><li><a href="probabilities.monte-carlo-api.html" class="wiki_link">probabilities.monte-carlo</a></li><li><a href="probabilities.random-numbers-api.html" class="wiki_link">probabilities.random-numbers</a></li><li><a href="profile-api.html" class="wiki_link">profile</a></li><li><a href="prxml-api.html" class="wiki_link">prxml</a></li><li><a href="repl-ln-api.html" class="wiki_link">repl-ln</a></li><li><a href="repl-utils-api.html" class="wiki_link">repl-utils</a></li><li><a href="seq-utils-api.html" class="wiki_link">seq-utils</a></li><li><a href="server-socket-api.html" class="wiki_link">server-socket</a></li><li><a href="set-api.html" class="wiki_link">set</a></li><li><a href="shell-out-api.html" class="wiki_link">shell-out</a></li><li><a href="singleton-api.html" class="wiki_link">singleton</a></li><li><a href="sql-api.html" class="wiki_link">sql</a></li><li><a href="str-utils-api.html" class="wiki_link">str-utils</a></li><li><a href="str-utils2-api.html" class="wiki_link">str-utils2</a></li><li><a href="stream-utils-api.html" class="wiki_link">stream-utils</a></li><li><a href="swing-utils-api.html" class="wiki_link">swing-utils</a></li><li><a href="trace-api.html" class="wiki_link">trace</a></li><li><a href="types-api.html" class="wiki_link">types</a></li><li><a href="with-ns-api.html" class="wiki_link">with-ns</a></li><li><a href="zip-filter-api.html" class="wiki_link">zip-filter</a></li>
+      <li><a href="accumulators-api.html" class="wiki_link">accumulators</a></li><li><a href="agent-utils-api.html" class="wiki_link">agent-utils</a></li><li><a href="classpath-api.html" class="wiki_link">classpath</a></li><li><a href="combinatorics-api.html" class="wiki_link">combinatorics</a></li><li><a href="command-line-api.html" class="wiki_link">command-line</a></li><li><a href="complex-numbers-api.html" class="wiki_link">complex-numbers</a></li><li><a href="cond-api.html" class="wiki_link">cond</a></li><li><a href="condition-api.html" class="wiki_link">condition</a></li><li><a href="core-api.html" class="wiki_link">core</a></li><li><a href="dataflow-api.html" class="wiki_link">dataflow</a></li><li><a href="datalog-api.html" class="wiki_link">datalog</a></li><li><a href="def-api.html" class="wiki_link">def</a></li><li><a href="duck-streams-api.html" class="wiki_link">duck-streams</a></li><li><a href="error-kit-api.html" class="wiki_link">error-kit</a></li><li><a href="except-api.html" class="wiki_link">except</a></li><li><a href="fcase-api.html" class="wiki_link">fcase</a></li><li><a href="find-namespaces-api.html" class="wiki_link">find-namespaces</a></li><li><a href="fnmap-api.html" class="wiki_link">fnmap</a></li><li><a href="gen-html-docs-api.html" class="wiki_link">gen-html-docs</a></li><li><a href="generic.arithmetic-api.html" class="wiki_link">generic.arithmetic</a></li><li><a href="generic.collection-api.html" class="wiki_link">generic.collection</a></li><li><a href="generic.comparison-api.html" class="wiki_link">generic.comparison</a></li><li><a href="generic.functor-api.html" class="wiki_link">generic.functor</a></li><li><a href="generic.math-functions-api.html" class="wiki_link">generic.math-functions</a></li><li><a href="graph-api.html" class="wiki_link">graph</a></li><li><a href="greatest-least-api.html" class="wiki_link">greatest-least</a></li><li><a href="http.agent-api.html" class="wiki_link">http.agent</a></li><li><a href="http.connection-api.html" class="wiki_link">http.connection</a></li><li><a href="import-static-api.html" class="wiki_link">import-static</a></li><li><a href="jar-api.html" class="wiki_link">jar</a></li><li><a href="java-utils-api.html" class="wiki_link">java-utils</a></li><li><a href="javadoc.browse-api.html" class="wiki_link">javadoc.browse</a></li><li><a href="jmx-api.html" class="wiki_link">jmx</a></li><li><a href="json.read-api.html" class="wiki_link">json.read</a></li><li><a href="json.write-api.html" class="wiki_link">json.write</a></li><li><a href="lazy-seqs-api.html" class="wiki_link">lazy-seqs</a></li><li><a href="lazy-xml-api.html" class="wiki_link">lazy-xml</a></li><li><a href="logging-api.html" class="wiki_link">logging</a></li><li><a href="macro-utils-api.html" class="wiki_link">macro-utils</a></li><li><a href="macros-api.html" class="wiki_link">macros</a></li><li><a href="map-utils-api.html" class="wiki_link">map-utils</a></li><li><a href="math-api.html" class="wiki_link">math</a></li><li><a href="miglayout-api.html" class="wiki_link">miglayout</a></li><li><a href="mmap-api.html" class="wiki_link">mmap</a></li><li><a href="monadic-io-streams-api.html" class="wiki_link">monadic-io-streams</a></li><li><a href="monads-api.html" class="wiki_link">monads</a></li><li><a href="ns-utils-api.html" class="wiki_link">ns-utils</a></li><li><a href="pprint-api.html" class="wiki_link">pprint</a></li><li><a href="probabilities.finite-distributions-api.html" class="wiki_link">probabilities.finite-distributions</a></li><li><a href="probabilities.monte-carlo-api.html" class="wiki_link">probabilities.monte-carlo</a></li><li><a href="probabilities.random-numbers-api.html" class="wiki_link">probabilities.random-numbers</a></li><li><a href="profile-api.html" class="wiki_link">profile</a></li><li><a href="prxml-api.html" class="wiki_link">prxml</a></li><li><a href="repl-ln-api.html" class="wiki_link">repl-ln</a></li><li><a href="repl-utils-api.html" class="wiki_link">repl-utils</a></li><li><a href="seq-utils-api.html" class="wiki_link">seq-utils</a></li><li><a href="server-socket-api.html" class="wiki_link">server-socket</a></li><li><a href="set-api.html" class="wiki_link">set</a></li><li><a href="shell-out-api.html" class="wiki_link">shell-out</a></li><li><a href="singleton-api.html" class="wiki_link">singleton</a></li><li><a href="sql-api.html" class="wiki_link">sql</a></li><li><a href="str-utils-api.html" class="wiki_link">str-utils</a></li><li><a href="str-utils2-api.html" class="wiki_link">str-utils2</a></li><li><a href="stream-utils-api.html" class="wiki_link">stream-utils</a></li><li><a href="swing-utils-api.html" class="wiki_link">swing-utils</a></li><li><a href="trace-api.html" class="wiki_link">trace</a></li><li><a href="types-api.html" class="wiki_link">types</a></li><li><a href="with-ns-api.html" class="wiki_link">with-ns</a></li><li><a href="zip-filter-api.html" class="wiki_link">zip-filter</a></li>
     </ul>
   </div>
 </div>
@@ -106,7 +106,7 @@ by <span id="author">Jeffrey Straszheim</span><br />
   <pre id="var-usage">Usage: (add-loops g)
 </pre>
   <pre id="var-docstr">For each node n, add the edge n-&gt;n if not already present.</pre>
-  <a href="http://github.com/richhickey/clojure-contrib/blob/2d0079c159a37740173bbe289daca41e48723bfd/src/clojure/contrib/graph.clj#L49" id="var-source">Source</a>
+  <a href="http://github.com/richhickey/clojure-contrib/blob/6dd2205627cd524894b1175da20ce9c5ac65aef7/src/clojure/contrib/graph.clj#L49" id="var-source">Source</a>
 </div><div id="var-entry">
   <hr />
   <h2 id="graph/component-graph">component-graph</h2>
@@ -118,7 +118,7 @@ by <span id="author">Jeffrey Straszheim</span><br />
 Each node in the new graph will be a set of nodes from the old.
 These sets are the strongly connected components.  Each edge will
 be the union of the corresponding edges of the prior graph.</pre>
-  <a href="http://github.com/richhickey/clojure-contrib/blob/2d0079c159a37740173bbe289daca41e48723bfd/src/clojure/contrib/graph.clj#L133" id="var-source">Source</a>
+  <a href="http://github.com/richhickey/clojure-contrib/blob/6dd2205627cd524894b1175da20ce9c5ac65aef7/src/clojure/contrib/graph.clj#L133" id="var-source">Source</a>
 </div><div id="var-entry">
   <hr />
   <h2 id="graph/dependency-list">dependency-list</h2>
@@ -130,7 +130,7 @@ set of nodes at index 0 are independent.  The set at index 1 depend
 on index 0; those at 2 depend on 0 and 1, and so on.  Those withing
 a set have no mutual dependencies.  Assume the input graph (which
 much be acyclic) has an edge a-&gt;b when a depends on b.</pre>
-  <a href="http://github.com/richhickey/clojure-contrib/blob/2d0079c159a37740173bbe289daca41e48723bfd/src/clojure/contrib/graph.clj#L190" id="var-source">Source</a>
+  <a href="http://github.com/richhickey/clojure-contrib/blob/6dd2205627cd524894b1175da20ce9c5ac65aef7/src/clojure/contrib/graph.clj#L190" id="var-source">Source</a>
 </div><div id="var-entry">
   <hr />
   <h2 id="graph/fixed-point">fixed-point</h2>
@@ -140,7 +140,7 @@ much be acyclic) has an edge a-&gt;b when a depends on b.</pre>
   <pre id="var-docstr">Repeatedly apply fun to data until (equal old-data new-data)
 returns true.  If max iterations occur, it will throw an
 exception.  Set max to nil for unlimited iterations.</pre>
-  <a href="http://github.com/richhickey/clojure-contrib/blob/2d0079c159a37740173bbe289daca41e48723bfd/src/clojure/contrib/graph.clj#L167" id="var-source">Source</a>
+  <a href="http://github.com/richhickey/clojure-contrib/blob/6dd2205627cd524894b1175da20ce9c5ac65aef7/src/clojure/contrib/graph.clj#L167" id="var-source">Source</a>
 </div><div id="var-entry">
   <hr />
   <h2 id="graph/get-neighbors">get-neighbors</h2>
@@ -148,7 +148,7 @@ exception.  Set max to nil for unlimited iterations.</pre>
   <pre id="var-usage">Usage: (get-neighbors g n)
 </pre>
   <pre id="var-docstr">Get the neighbors of a node.</pre>
-  <a href="http://github.com/richhickey/clojure-contrib/blob/2d0079c159a37740173bbe289daca41e48723bfd/src/clojure/contrib/graph.clj#L29" id="var-source">Source</a>
+  <a href="http://github.com/richhickey/clojure-contrib/blob/6dd2205627cd524894b1175da20ce9c5ac65aef7/src/clojure/contrib/graph.clj#L29" id="var-source">Source</a>
 </div><div id="var-entry">
   <hr />
   <h2 id="graph/lazy-walk">lazy-walk</h2>
@@ -159,7 +159,7 @@ exception.  Set max to nil for unlimited iterations.</pre>
   <pre id="var-docstr">Return a lazy sequence of the nodes of a graph starting a node n.  Optionally,
 provide a set of visited notes (v) and a collection of nodes to
 visit (ns).</pre>
-  <a href="http://github.com/richhickey/clojure-contrib/blob/2d0079c159a37740173bbe289daca41e48723bfd/src/clojure/contrib/graph.clj#L68" id="var-source">Source</a>
+  <a href="http://github.com/richhickey/clojure-contrib/blob/6dd2205627cd524894b1175da20ce9c5ac65aef7/src/clojure/contrib/graph.clj#L68" id="var-source">Source</a>
 </div><div id="var-entry">
   <hr />
   <h2 id="graph/post-ordered-nodes">post-ordered-nodes</h2>
@@ -167,7 +167,7 @@ visit (ns).</pre>
   <pre id="var-usage">Usage: (post-ordered-nodes g)
 </pre>
   <pre id="var-docstr">Return a sequence of indexes of a post-ordered walk of the graph.</pre>
-  <a href="http://github.com/richhickey/clojure-contrib/blob/2d0079c159a37740173bbe289daca41e48723bfd/src/clojure/contrib/graph.clj#L110" id="var-source">Source</a>
+  <a href="http://github.com/richhickey/clojure-contrib/blob/6dd2205627cd524894b1175da20ce9c5ac65aef7/src/clojure/contrib/graph.clj#L110" id="var-source">Source</a>
 </div><div id="var-entry">
   <hr />
   <h2 id="graph/recursive-component?">recursive-component?</h2>
@@ -175,7 +175,7 @@ visit (ns).</pre>
   <pre id="var-usage">Usage: (recursive-component? g ns)
 </pre>
   <pre id="var-docstr">Is the component (recieved from scc) self recursive?</pre>
-  <a href="http://github.com/richhickey/clojure-contrib/blob/2d0079c159a37740173bbe289daca41e48723bfd/src/clojure/contrib/graph.clj#L151" id="var-source">Source</a>
+  <a href="http://github.com/richhickey/clojure-contrib/blob/6dd2205627cd524894b1175da20ce9c5ac65aef7/src/clojure/contrib/graph.clj#L151" id="var-source">Source</a>
 </div><div id="var-entry">
   <hr />
   <h2 id="graph/remove-loops">remove-loops</h2>
@@ -183,7 +183,7 @@ visit (ns).</pre>
   <pre id="var-usage">Usage: (remove-loops g)
 </pre>
   <pre id="var-docstr">For each node n, remove any edges n-&gt;n.</pre>
-  <a href="http://github.com/richhickey/clojure-contrib/blob/2d0079c159a37740173bbe289daca41e48723bfd/src/clojure/contrib/graph.clj#L57" id="var-source">Source</a>
+  <a href="http://github.com/richhickey/clojure-contrib/blob/6dd2205627cd524894b1175da20ce9c5ac65aef7/src/clojure/contrib/graph.clj#L57" id="var-source">Source</a>
 </div><div id="var-entry">
   <hr />
   <h2 id="graph/reverse-graph">reverse-graph</h2>
@@ -192,7 +192,7 @@ visit (ns).</pre>
 </pre>
   <pre id="var-docstr">Given a directed graph, return another directed graph with the
 order of the edges reversed.</pre>
-  <a href="http://github.com/richhickey/clojure-contrib/blob/2d0079c159a37740173bbe289daca41e48723bfd/src/clojure/contrib/graph.clj#L37" id="var-source">Source</a>
+  <a href="http://github.com/richhickey/clojure-contrib/blob/6dd2205627cd524894b1175da20ce9c5ac65aef7/src/clojure/contrib/graph.clj#L37" id="var-source">Source</a>
 </div><div id="var-entry">
   <hr />
   <h2 id="graph/scc">scc</h2>
@@ -201,7 +201,7 @@ order of the edges reversed.</pre>
 </pre>
   <pre id="var-docstr">Returns, as a sequence of sets, the strongly connected components
 of g.</pre>
-  <a href="http://github.com/richhickey/clojure-contrib/blob/2d0079c159a37740173bbe289daca41e48723bfd/src/clojure/contrib/graph.clj#L117" id="var-source">Source</a>
+  <a href="http://github.com/richhickey/clojure-contrib/blob/6dd2205627cd524894b1175da20ce9c5ac65aef7/src/clojure/contrib/graph.clj#L117" id="var-source">Source</a>
 </div><div id="var-entry">
   <hr />
   <h2 id="graph/self-recursive-sets">self-recursive-sets</h2>
@@ -210,7 +210,7 @@ of g.</pre>
 </pre>
   <pre id="var-docstr">Returns, as a sequence of sets, the components of a graph that are
 self-recursive.</pre>
-  <a href="http://github.com/richhickey/clojure-contrib/blob/2d0079c159a37740173bbe289daca41e48723bfd/src/clojure/contrib/graph.clj#L158" id="var-source">Source</a>
+  <a href="http://github.com/richhickey/clojure-contrib/blob/6dd2205627cd524894b1175da20ce9c5ac65aef7/src/clojure/contrib/graph.clj#L158" id="var-source">Source</a>
 </div><div id="var-entry">
   <hr />
   <h2 id="graph/stratification-list">stratification-list</h2>
@@ -222,7 +222,7 @@ provided.  The first is as dependency-list.  The second (which may
 have cycles) provides a partial-dependency relation.  If node a
 depends on node b (meaning an edge a-&gt;b exists) in the second
 graph, node a must be equal or later in the sequence.</pre>
-  <a href="http://github.com/richhickey/clojure-contrib/blob/2d0079c159a37740173bbe289daca41e48723bfd/src/clojure/contrib/graph.clj#L207" id="var-source">Source</a>
+  <a href="http://github.com/richhickey/clojure-contrib/blob/6dd2205627cd524894b1175da20ce9c5ac65aef7/src/clojure/contrib/graph.clj#L207" id="var-source">Source</a>
 </div><div id="var-entry">
   <hr />
   <h2 id="graph/transitive-closure">transitive-closure</h2>
@@ -236,7 +236,7 @@ regardless of whether such loops exist in the original graph.  This
 version does not.  Loops will be included only if produced by
 cycles in the graph.  If you have code that depends on such
 behavior, call (-&gt; g transitive-closure add-loops)</pre>
-  <a href="http://github.com/richhickey/clojure-contrib/blob/2d0079c159a37740173bbe289daca41e48723bfd/src/clojure/contrib/graph.clj#L81" id="var-source">Source</a>
+  <a href="http://github.com/richhickey/clojure-contrib/blob/6dd2205627cd524894b1175da20ce9c5ac65aef7/src/clojure/contrib/graph.clj#L81" id="var-source">Source</a>
 </div>