Autodoc commit for 1.2.x/e4ea06c9, master/b0f2e778, 1.1.x/d132c5f1

1 files changed, 15 insertions, 15 deletions

diff --git a/graph-api.html b/graph-api.html
index af7e09c4..b0ec18fb 100644
--- a/graph-api.html
+++ b/graph-api.html
@@ -115,7 +115,7 @@ namespace.
   <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/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L49" id="var-source">Source</a>
+  <a href="http://github.com/clojure/clojure-contrib/blob/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L49" id="var-source">Source</a>
 </div><div id="var-entry">
   <br />
   <hr />
@@ -130,7 +130,7 @@ 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/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L133" id="var-source">Source</a>
+  <a href="http://github.com/clojure/clojure-contrib/blob/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L133" id="var-source">Source</a>
 </div><div id="var-entry">
   <br />
   <hr />
@@ -145,7 +145,7 @@ 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/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L190" id="var-source">Source</a>
+  <a href="http://github.com/clojure/clojure-contrib/blob/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L190" id="var-source">Source</a>
 </div><div id="var-entry">
   <br />
   <hr />
@@ -158,7 +158,7 @@ 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/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L167" id="var-source">Source</a>
+  <a href="http://github.com/clojure/clojure-contrib/blob/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L167" id="var-source">Source</a>
 </div><div id="var-entry">
   <br />
   <hr />
@@ -169,7 +169,7 @@ exception.  Set max to nil for unlimited iterations.</pre>
   <pre id="var-docstr">Get the neighbors of a node.</pre>
   
   
-  <a href="http://github.com/richhickey/clojure-contrib/blob/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L29" id="var-source">Source</a>
+  <a href="http://github.com/clojure/clojure-contrib/blob/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L29" id="var-source">Source</a>
 </div><div id="var-entry">
   <br />
   <hr />
@@ -183,7 +183,7 @@ 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/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L68" id="var-source">Source</a>
+  <a href="http://github.com/clojure/clojure-contrib/blob/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L68" id="var-source">Source</a>
 </div><div id="var-entry">
   <br />
   <hr />
@@ -194,7 +194,7 @@ visit (ns).</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/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L110" id="var-source">Source</a>
+  <a href="http://github.com/clojure/clojure-contrib/blob/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L110" id="var-source">Source</a>
 </div><div id="var-entry">
   <br />
   <hr />
@@ -205,7 +205,7 @@ visit (ns).</pre>
   <pre id="var-docstr">Is the component (recieved from scc) self recursive?</pre>
   
   
-  <a href="http://github.com/richhickey/clojure-contrib/blob/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L151" id="var-source">Source</a>
+  <a href="http://github.com/clojure/clojure-contrib/blob/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L151" id="var-source">Source</a>
 </div><div id="var-entry">
   <br />
   <hr />
@@ -216,7 +216,7 @@ visit (ns).</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/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L57" id="var-source">Source</a>
+  <a href="http://github.com/clojure/clojure-contrib/blob/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L57" id="var-source">Source</a>
 </div><div id="var-entry">
   <br />
   <hr />
@@ -228,7 +228,7 @@ visit (ns).</pre>
 order of the edges reversed.</pre>
   
   
-  <a href="http://github.com/richhickey/clojure-contrib/blob/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L37" id="var-source">Source</a>
+  <a href="http://github.com/clojure/clojure-contrib/blob/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L37" id="var-source">Source</a>
 </div><div id="var-entry">
   <br />
   <hr />
@@ -240,7 +240,7 @@ order of the edges reversed.</pre>
 of g.</pre>
   
   
-  <a href="http://github.com/richhickey/clojure-contrib/blob/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L117" id="var-source">Source</a>
+  <a href="http://github.com/clojure/clojure-contrib/blob/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L117" id="var-source">Source</a>
 </div><div id="var-entry">
   <br />
   <hr />
@@ -252,7 +252,7 @@ of g.</pre>
 self-recursive.</pre>
   
   
-  <a href="http://github.com/richhickey/clojure-contrib/blob/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L158" id="var-source">Source</a>
+  <a href="http://github.com/clojure/clojure-contrib/blob/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L158" id="var-source">Source</a>
 </div><div id="var-entry">
   <br />
   <hr />
@@ -267,7 +267,7 @@ 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/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L207" id="var-source">Source</a>
+  <a href="http://github.com/clojure/clojure-contrib/blob/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L207" id="var-source">Source</a>
 </div><div id="var-entry">
   <br />
   <hr />
@@ -284,7 +284,7 @@ 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/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L81" id="var-source">Source</a>
+  <a href="http://github.com/clojure/clojure-contrib/blob/b8d2743d3a89e13fc9deb2844ca2167b34aaa9b6/src/main/clojure/clojure/contrib/graph.clj#L81" id="var-source">Source</a>
 </div>
 
 
@@ -294,7 +294,7 @@ behavior, call (-&gt; g transitive-closure add-loops)</pre>
           </div>
 	</div>
 	<div id="foot">
-	  <div style="text-align: center;" id="copyright">Copyright 2007-2009 by Rich Hickey and the various contributors</div>
+	  <div style="text-align: center;" id="copyright">Copyright 2007-2010 by Rich Hickey and the various contributors</div>
 	</div>
       </div>
       <div id="DesignedBy">Logo &amp; site design by <a title="Visit Tom Hickey's website." href="http://www.tomhickey.com">Tom Hickey</a>.<br />