A

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

  

B

C

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

  

D

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

  

E

F

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

  

G

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

  

H

I

J

K

L

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

  

M

N

O

P

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

  

Q

R

 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...

  

S

 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...

  

T

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

  

U

V

W

X

Y

Z

Other