diff options
Diffstat (limited to 'branch-1.1.x/graph-api.html')
| -rw-r--r-- | branch-1.1.x/graph-api.html | 31 |
1 files changed, 14 insertions, 17 deletions
diff --git a/branch-1.1.x/graph-api.html b/branch-1.1.x/graph-api.html index 83e49502..152d0ccf 100644 --- a/branch-1.1.x/graph-api.html +++ b/branch-1.1.x/graph-api.html @@ -6,9 +6,6 @@ <link media="all" type="text/css" href="../static/clojure.css" rel="stylesheet" /> <link media="all" type="text/css" href="../static/wiki.css" rel="stylesheet" /> <link media="all" type="text/css" href="../static/internal.css" rel="stylesheet" /> - <!-- TODO: are we using these (from clojure.org)? If so, add the files --> - <script src="file/view/code_highlighter.js" type="text/javascript"></script> - <script src="file/view/clojure.js" type="text/javascript"></script> <style>.menuWrapper{height: 36px;}</style> <!--[if lte IE 6]> <link rel="stylesheet" href="http://www.wikispaces.com/_/2009051601/s/internal_ie.css" type="text/css" /> @@ -112,7 +109,7 @@ namespace. <pre id="var-docstr">For each node n, add the edge n->n if not already present.</pre> - <a href="http://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L49" id="var-source">Source</a> + <a href="https://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L49" id="var-source">Source</a> </div><div id="var-entry"> <br /> <hr /> @@ -127,7 +124,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/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L133" id="var-source">Source</a> + <a href="https://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L133" id="var-source">Source</a> </div><div id="var-entry"> <br /> <hr /> @@ -142,7 +139,7 @@ a set have no mutual dependencies. Assume the input graph (which much be acyclic) has an edge a->b when a depends on b.</pre> - <a href="http://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L190" id="var-source">Source</a> + <a href="https://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L190" id="var-source">Source</a> </div><div id="var-entry"> <br /> <hr /> @@ -155,7 +152,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/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L167" id="var-source">Source</a> + <a href="https://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L167" id="var-source">Source</a> </div><div id="var-entry"> <br /> <hr /> @@ -166,7 +163,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/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L29" id="var-source">Source</a> + <a href="https://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L29" id="var-source">Source</a> </div><div id="var-entry"> <br /> <hr /> @@ -180,7 +177,7 @@ provide a set of visited notes (v) and a collection of nodes to visit (ns).</pre> - <a href="http://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L68" id="var-source">Source</a> + <a href="https://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L68" id="var-source">Source</a> </div><div id="var-entry"> <br /> <hr /> @@ -191,7 +188,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/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L110" id="var-source">Source</a> + <a href="https://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L110" id="var-source">Source</a> </div><div id="var-entry"> <br /> <hr /> @@ -202,7 +199,7 @@ visit (ns).</pre> <pre id="var-docstr">Is the component (recieved from scc) self recursive?</pre> - <a href="http://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L151" id="var-source">Source</a> + <a href="https://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L151" id="var-source">Source</a> </div><div id="var-entry"> <br /> <hr /> @@ -213,7 +210,7 @@ visit (ns).</pre> <pre id="var-docstr">For each node n, remove any edges n->n.</pre> - <a href="http://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L57" id="var-source">Source</a> + <a href="https://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L57" id="var-source">Source</a> </div><div id="var-entry"> <br /> <hr /> @@ -225,7 +222,7 @@ visit (ns).</pre> order of the edges reversed.</pre> - <a href="http://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L37" id="var-source">Source</a> + <a href="https://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L37" id="var-source">Source</a> </div><div id="var-entry"> <br /> <hr /> @@ -237,7 +234,7 @@ order of the edges reversed.</pre> of g.</pre> - <a href="http://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L117" id="var-source">Source</a> + <a href="https://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L117" id="var-source">Source</a> </div><div id="var-entry"> <br /> <hr /> @@ -249,7 +246,7 @@ of g.</pre> self-recursive.</pre> - <a href="http://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L158" id="var-source">Source</a> + <a href="https://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L158" id="var-source">Source</a> </div><div id="var-entry"> <br /> <hr /> @@ -264,7 +261,7 @@ depends on node b (meaning an edge a->b exists) in the second graph, node a must be equal or later in the sequence.</pre> - <a href="http://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L207" id="var-source">Source</a> + <a href="https://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L207" id="var-source">Source</a> </div><div id="var-entry"> <br /> <hr /> @@ -281,7 +278,7 @@ cycles in the graph. If you have code that depends on such behavior, call (-> g transitive-closure add-loops)</pre> - <a href="http://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L81" id="var-source">Source</a> + <a href="https://github.com/clojure/clojure-contrib/blob/86e90011e274910c618a5592d21ba3ce290a6855/src/clojure/contrib/graph.clj#L81" id="var-source">Source</a> </div> |