Autodoc commit for master/4fe738db, 1.1.x/d132c5f1

1 files changed, 14 insertions, 14 deletions

diff --git a/graph-api.html b/graph-api.html
index e9b87e34..0d61a51d 100644
--- a/graph-api.html
+++ b/graph-api.html
@@ -110,7 +110,7 @@ by <span id="author">Jeffrey Straszheim</span><br />
   <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/2ede388a9267d175bfaa7781ee9d57532eb4f20f/src/main/clojure/clojure/contrib/graph.clj#L49" id="var-source">Source</a>
+  
 </div><div id="var-entry">
   <br />
   <hr />
@@ -125,7 +125,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/2ede388a9267d175bfaa7781ee9d57532eb4f20f/src/main/clojure/clojure/contrib/graph.clj#L133" id="var-source">Source</a>
+  
 </div><div id="var-entry">
   <br />
   <hr />
@@ -140,7 +140,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/2ede388a9267d175bfaa7781ee9d57532eb4f20f/src/main/clojure/clojure/contrib/graph.clj#L190" id="var-source">Source</a>
+  
 </div><div id="var-entry">
   <br />
   <hr />
@@ -153,7 +153,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/2ede388a9267d175bfaa7781ee9d57532eb4f20f/src/main/clojure/clojure/contrib/graph.clj#L167" id="var-source">Source</a>
+  
 </div><div id="var-entry">
   <br />
   <hr />
@@ -164,7 +164,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/2ede388a9267d175bfaa7781ee9d57532eb4f20f/src/main/clojure/clojure/contrib/graph.clj#L29" id="var-source">Source</a>
+  
 </div><div id="var-entry">
   <br />
   <hr />
@@ -178,7 +178,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/2ede388a9267d175bfaa7781ee9d57532eb4f20f/src/main/clojure/clojure/contrib/graph.clj#L68" id="var-source">Source</a>
+  
 </div><div id="var-entry">
   <br />
   <hr />
@@ -189,7 +189,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/2ede388a9267d175bfaa7781ee9d57532eb4f20f/src/main/clojure/clojure/contrib/graph.clj#L110" id="var-source">Source</a>
+  
 </div><div id="var-entry">
   <br />
   <hr />
@@ -200,7 +200,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/2ede388a9267d175bfaa7781ee9d57532eb4f20f/src/main/clojure/clojure/contrib/graph.clj#L151" id="var-source">Source</a>
+  
 </div><div id="var-entry">
   <br />
   <hr />
@@ -211,7 +211,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/2ede388a9267d175bfaa7781ee9d57532eb4f20f/src/main/clojure/clojure/contrib/graph.clj#L57" id="var-source">Source</a>
+  
 </div><div id="var-entry">
   <br />
   <hr />
@@ -223,7 +223,7 @@ visit (ns).</pre>
 order of the edges reversed.</pre>
   
   
-  <a href="http://github.com/richhickey/clojure-contrib/blob/2ede388a9267d175bfaa7781ee9d57532eb4f20f/src/main/clojure/clojure/contrib/graph.clj#L37" id="var-source">Source</a>
+  
 </div><div id="var-entry">
   <br />
   <hr />
@@ -235,7 +235,7 @@ order of the edges reversed.</pre>
 of g.</pre>
   
   
-  <a href="http://github.com/richhickey/clojure-contrib/blob/2ede388a9267d175bfaa7781ee9d57532eb4f20f/src/main/clojure/clojure/contrib/graph.clj#L117" id="var-source">Source</a>
+  
 </div><div id="var-entry">
   <br />
   <hr />
@@ -247,7 +247,7 @@ of g.</pre>
 self-recursive.</pre>
   
   
-  <a href="http://github.com/richhickey/clojure-contrib/blob/2ede388a9267d175bfaa7781ee9d57532eb4f20f/src/main/clojure/clojure/contrib/graph.clj#L158" id="var-source">Source</a>
+  
 </div><div id="var-entry">
   <br />
   <hr />
@@ -262,7 +262,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/2ede388a9267d175bfaa7781ee9d57532eb4f20f/src/main/clojure/clojure/contrib/graph.clj#L207" id="var-source">Source</a>
+  
 </div><div id="var-entry">
   <br />
   <hr />
@@ -279,7 +279,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/2ede388a9267d175bfaa7781ee9d57532eb4f20f/src/main/clojure/clojure/contrib/graph.clj#L81" id="var-source">Source</a>
+  
 </div>