```
add-loops function clojure.algo.graph For each node n, add the edge n->n if not already ...
```

```
component-graph function clojure.algo.graph Given a graph, perhaps with cycles, return a reduc...
```

```
dependency-list function clojure.algo.graph Similar to a topological sort, this returns a vect...
```

```
fixed-point function clojure.algo.graph Repeatedly apply fun to data until (equal old-data...
```

```
get-neighbors function clojure.algo.graph Get the neighbors of a node..
```

```
lazy-walk function clojure.algo.graph Return a lazy sequence of the nodes of a graph sta...
```

```
post-ordered-nodes function clojure.algo.graph Return a sequence of indexes of a post-ordered wal...
```

recursive-component? function clojure.algo.graph Is the component (recieved from scc) self recursiv... remove-loops function clojure.algo.graph For each node n, remove any edges n->n.. reverse-graph function clojure.algo.graph Given a directed graph, return another directed gr...

scc function clojure.algo.graph Returns, as a sequence of sets, the strongly conne... self-recursive-sets function clojure.algo.graph Returns, as a sequence of sets, the components of ... stratification-list function clojure.algo.graph Similar to dependency-list (see doc), except two g...

```
transitive-closure function clojure.algo.graph Returns the transitive closure of a graph. The ne...
```

Copyright 2007-2017 by Rich Hickey and the various contributors

Logo & site design by Tom Hickey.

Clojure auto-documentation system by Tom Faulhaber.

Clojure auto-documentation system by Tom Faulhaber.