aboutsummaryrefslogtreecommitdiff
path: root/branch-master/graph-api.html
diff options
context:
space:
mode:
authorTom Faulhaber <git_net@infolace.com>2010-08-20 07:15:04 -0700
committerTom Faulhaber <git_net@infolace.com>2010-08-20 07:15:04 -0700
commit4a44d6c75533e0a13b1a6e9c206f0d0a87f63fef (patch)
treed01bae80ab2f4820388d3cf7b7a01e0e77cbb9cb /branch-master/graph-api.html
parentf9f9c9242b61ed3ac1edf3d8db51e3f7d54b9778 (diff)
Autodoc commit for 1.2.x/e4ea06c9, master/202e81e9, 1.1.x/d132c5f1
Diffstat (limited to 'branch-master/graph-api.html')
-rw-r--r--branch-master/graph-api.html306
1 files changed, 0 insertions, 306 deletions
diff --git a/branch-master/graph-api.html b/branch-master/graph-api.html
deleted file mode 100644
index 012f30ec..00000000
--- a/branch-master/graph-api.html
+++ /dev/null
@@ -1,306 +0,0 @@
-<html>
- <head>
- <title>graph - clojure-contrib next API documentation</title>
- <link href="../static/favicon.png" rel="icon" />
- <link href="../static/favicon.png" rel="shortcut icon" />
- <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" />
- <![endif]-->
- </head>
-<!--
-This document was auto-generated from the source by the clojure autodoc system.
-To report errors or ask questions about the overall documentation structure, formatting,
-etc., contact Tom Faulhaber (google mail name: tomfaulhaber).
-For errors in the documentation of a particular namespace, contact the author of that
-namespace.
--->
- <body>
- <div id="AllContentContainer">
- <div id="Header">
- <a id="Logo" href="index.html"><img alt="Clojure" height="100" width="100" src="../static/clojure-icon.gif" /></a>
- <h1><a title="page header title" id="page-header" href="index.html">Clojure-contrib API Reference</a></h1>
- </div>
- <div id="leftcolumn"><div style="text-align: center;"></div>
-<div class="menu">
- <div class="WikiCustomNav WikiElement wiki">
- <span class="toc-header"><span id="project-name">clojure-contrib</span> <span id="version">next</span> API</span><br />
- <ul>
- <li><a class="wiki_link" href="index.html">Overview</a></li>
- <li><a class="wiki_link" href="api-index.html">API Index</a></li>
- </ul>
- <span class="toc-header">Namespaces</span>
- <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="apply-macro-api.html" class="wiki_link">apply-macro</a></li><li><a href="base64-api.html" class="wiki_link">base64</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="io-api.html" class="wiki_link">io</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-api.html" class="wiki_link">json</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="mock-api.html" class="wiki_link">mock</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="priority-map-api.html" class="wiki_link">priority-map</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="properties-api.html" class="wiki_link">properties</a></li><li><a href="prxml-api.html" class="wiki_link">prxml</a></li><li><a href="reflect-api.html" class="wiki_link">reflect</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-api.html" class="wiki_link">seq</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-api.html" class="wiki_link">shell</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="string-api.html" class="wiki_link">string</a></li><li><a href="strint-api.html" class="wiki_link">strint</a></li><li><a href="swing-utils-api.html" class="wiki_link">swing-utils</a></li><li><a href="test-is-api.html" class="wiki_link">test-is</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 class="BranchTOC">
- <span class="toc-header">Other Versions</span>
- <ul id="left-sidebar-branch-list">
- <li><a href="../index.html" class="wiki_link">v1.2 (beta 1)</a></li><li><a href="../branch-1.1.x/index.html" class="wiki_link">v1.1 (stable)</a></li>
- </ul>
- </div>
- <a href="http://clojure.org" class="wiki_link">Clojure Home</a>
- </div>
-</div>
-</div>
- <div id="rightcolumn">
- <div id="Content">
- <div class="contentBox"><div class="innerContentBox">
- <div id="content_view" class="wiki wikiPage">
- <div id="right-sidebar"><div id="toc">
- <h1 class="nopad">Table of Contents</h1>
- <div style="margin-left: 1em;" class="toc-section">
- <a href="#toc0">Overview</a>
- <div style="margin-left: 1em;" class="toc-entry">
- <a href="#clojure.contrib.graph/add-loops">add-loops</a>
- </div><div style="margin-left: 1em;" class="toc-entry">
- <a href="#clojure.contrib.graph/component-graph">component-graph</a>
- </div><div style="margin-left: 1em;" class="toc-entry">
- <a href="#clojure.contrib.graph/dependency-list">dependency-list</a>
- </div><div style="margin-left: 1em;" class="toc-entry">
- <a href="#clojure.contrib.graph/fixed-point">fixed-point</a>
- </div><div style="margin-left: 1em;" class="toc-entry">
- <a href="#clojure.contrib.graph/get-neighbors">get-neighbors</a>
- </div><div style="margin-left: 1em;" class="toc-entry">
- <a href="#clojure.contrib.graph/lazy-walk">lazy-walk</a>
- </div><div style="margin-left: 1em;" class="toc-entry">
- <a href="#clojure.contrib.graph/post-ordered-nodes">post-ordered-nodes</a>
- </div><div style="margin-left: 1em;" class="toc-entry">
- <a href="#clojure.contrib.graph/recursive-component?">recursive-component?</a>
- </div><div style="margin-left: 1em;" class="toc-entry">
- <a href="#clojure.contrib.graph/remove-loops">remove-loops</a>
- </div><div style="margin-left: 1em;" class="toc-entry">
- <a href="#clojure.contrib.graph/reverse-graph">reverse-graph</a>
- </div><div style="margin-left: 1em;" class="toc-entry">
- <a href="#clojure.contrib.graph/scc">scc</a>
- </div><div style="margin-left: 1em;" class="toc-entry">
- <a href="#clojure.contrib.graph/self-recursive-sets">self-recursive-sets</a>
- </div><div style="margin-left: 1em;" class="toc-entry">
- <a href="#clojure.contrib.graph/stratification-list">stratification-list</a>
- </div><div style="margin-left: 1em;" class="toc-entry">
- <a href="#clojure.contrib.graph/transitive-closure">transitive-closure</a>
- </div>
- <br />
- </div>
-</div>
-</div>
- <div id="content-tag"><h1 id="overview">API for <span id="namespace-name">graph</span>
- - <span id="header-project">clojure-contrib</span> <span id="header-version">next</span> (<span id="header-status">in development</span>)
- </h1>
-<span id="author-line">by <span id="author-name">Jeffrey Straszheim</span><br /></span>
-<br />Usage:
-<pre>
-(ns your-namespace
- (:require <span id="long-name">clojure.contrib.graph</span>))
-</pre><pre>
-</pre><h2>Overview</h2>
-<pre id="namespace-docstr">Basic graph theory algorithms</pre>
-
-
-<br />
-<h2>Public Variables and Functions</h2>
-<div id="var-entry">
- <br />
- <hr />
- <h2 id="clojure.contrib.graph/add-loops">add-loops</h2>
- <span id="var-type">function</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/7188a51605136f36524e4091fe806859114d6056/src/main/clojure/clojure/contrib/graph.clj#L49" id="var-source">Source</a>
-</div><div id="var-entry">
- <br />
- <hr />
- <h2 id="clojure.contrib.graph/component-graph">component-graph</h2>
- <span id="var-type">function</span><br />
- <pre id="var-usage">Usage: (component-graph g)
- (component-graph g sccs)
-</pre>
- <pre id="var-docstr">Given a graph, perhaps with cycles, return a reduced graph that is acyclic.
-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/7188a51605136f36524e4091fe806859114d6056/src/main/clojure/clojure/contrib/graph.clj#L133" id="var-source">Source</a>
-</div><div id="var-entry">
- <br />
- <hr />
- <h2 id="clojure.contrib.graph/dependency-list">dependency-list</h2>
- <span id="var-type">function</span><br />
- <pre id="var-usage">Usage: (dependency-list g)
-</pre>
- <pre id="var-docstr">Similar to a topological sort, this returns a vector of sets. The
-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/7188a51605136f36524e4091fe806859114d6056/src/main/clojure/clojure/contrib/graph.clj#L190" id="var-source">Source</a>
-</div><div id="var-entry">
- <br />
- <hr />
- <h2 id="clojure.contrib.graph/fixed-point">fixed-point</h2>
- <span id="var-type">function</span><br />
- <pre id="var-usage">Usage: (fixed-point data fun max equal)
-</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/7188a51605136f36524e4091fe806859114d6056/src/main/clojure/clojure/contrib/graph.clj#L167" id="var-source">Source</a>
-</div><div id="var-entry">
- <br />
- <hr />
- <h2 id="clojure.contrib.graph/get-neighbors">get-neighbors</h2>
- <span id="var-type">function</span><br />
- <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/7188a51605136f36524e4091fe806859114d6056/src/main/clojure/clojure/contrib/graph.clj#L29" id="var-source">Source</a>
-</div><div id="var-entry">
- <br />
- <hr />
- <h2 id="clojure.contrib.graph/lazy-walk">lazy-walk</h2>
- <span id="var-type">function</span><br />
- <pre id="var-usage">Usage: (lazy-walk g n)
- (lazy-walk g ns v)
-</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/7188a51605136f36524e4091fe806859114d6056/src/main/clojure/clojure/contrib/graph.clj#L68" id="var-source">Source</a>
-</div><div id="var-entry">
- <br />
- <hr />
- <h2 id="clojure.contrib.graph/post-ordered-nodes">post-ordered-nodes</h2>
- <span id="var-type">function</span><br />
- <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/7188a51605136f36524e4091fe806859114d6056/src/main/clojure/clojure/contrib/graph.clj#L110" id="var-source">Source</a>
-</div><div id="var-entry">
- <br />
- <hr />
- <h2 id="clojure.contrib.graph/recursive-component?">recursive-component?</h2>
- <span id="var-type">function</span><br />
- <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/7188a51605136f36524e4091fe806859114d6056/src/main/clojure/clojure/contrib/graph.clj#L151" id="var-source">Source</a>
-</div><div id="var-entry">
- <br />
- <hr />
- <h2 id="clojure.contrib.graph/remove-loops">remove-loops</h2>
- <span id="var-type">function</span><br />
- <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/7188a51605136f36524e4091fe806859114d6056/src/main/clojure/clojure/contrib/graph.clj#L57" id="var-source">Source</a>
-</div><div id="var-entry">
- <br />
- <hr />
- <h2 id="clojure.contrib.graph/reverse-graph">reverse-graph</h2>
- <span id="var-type">function</span><br />
- <pre id="var-usage">Usage: (reverse-graph g)
-</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/7188a51605136f36524e4091fe806859114d6056/src/main/clojure/clojure/contrib/graph.clj#L37" id="var-source">Source</a>
-</div><div id="var-entry">
- <br />
- <hr />
- <h2 id="clojure.contrib.graph/scc">scc</h2>
- <span id="var-type">function</span><br />
- <pre id="var-usage">Usage: (scc g)
-</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/7188a51605136f36524e4091fe806859114d6056/src/main/clojure/clojure/contrib/graph.clj#L117" id="var-source">Source</a>
-</div><div id="var-entry">
- <br />
- <hr />
- <h2 id="clojure.contrib.graph/self-recursive-sets">self-recursive-sets</h2>
- <span id="var-type">function</span><br />
- <pre id="var-usage">Usage: (self-recursive-sets g)
-</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/7188a51605136f36524e4091fe806859114d6056/src/main/clojure/clojure/contrib/graph.clj#L158" id="var-source">Source</a>
-</div><div id="var-entry">
- <br />
- <hr />
- <h2 id="clojure.contrib.graph/stratification-list">stratification-list</h2>
- <span id="var-type">function</span><br />
- <pre id="var-usage">Usage: (stratification-list g1 g2)
-</pre>
- <pre id="var-docstr">Similar to dependency-list (see doc), except two graphs are
-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/7188a51605136f36524e4091fe806859114d6056/src/main/clojure/clojure/contrib/graph.clj#L207" id="var-source">Source</a>
-</div><div id="var-entry">
- <br />
- <hr />
- <h2 id="clojure.contrib.graph/transitive-closure">transitive-closure</h2>
- <span id="var-type">function</span><br />
- <pre id="var-usage">Usage: (transitive-closure g)
-</pre>
- <pre id="var-docstr">Returns the transitive closure of a graph. The neighbors are lazily computed.
-
-Note: some version of this algorithm return all edges a-&gt;a
-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/7188a51605136f36524e4091fe806859114d6056/src/main/clojure/clojure/contrib/graph.clj#L81" id="var-source">Source</a>
-</div>
-
-
-</div>
- </div>
- </div>
- </div>
- </div>
- <div id="foot">
- <div style="text-align: center;" id="copyright">Copyright 2007-2009 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 />
- Clojure auto-documentation system by Tom Faulhaber.</div>
- </div>
- <!-- /AllContentContainer -->
- </body>
-
-</html> \ No newline at end of file