Clojure Contrib

Namespaces

clojure.contrib
- accumulators
- agent-utils
- apply-macro
- base64
- classpath
- combinatorics
- command-line
- complex-numbers
- cond
- condition
- core
- dataflow
- datalog
  - database
  - literals
  - magic
  - rules
  - softstrat
  - util
- def
- duck-streams
- error-kit
- except
- fcase
- find-namespaces
- fnmap
  - PersistentFnMap
- gen-html-docs
- generic
  - arithmetic
  - collection
  - comparison
  - functor
  - math-functions
- graph
- greatest-least
- http
  - agent
  - connection
- import-static
- io
- jar
- java-utils
- javadoc
  - browse
  - browse-ui
- jmx
  - Bean
- json
- lazy-seqs
- lazy-xml
- logging
- macro-utils
- macros
- map-utils
- math
- miglayout
  - internal
- mmap
- mock
  - test-adapter
- monadic-io-streams
- monads
- ns-utils
- pprint
  - column-writer
  - pretty-writer
  - utilities
- probabilities
  - finite-distributions
  - monte-carlo
  - random-numbers
- profile
- properties
- prxml
- reflect
- repl-ln
- repl-utils
- seq
- seq-utils
- server-socket
- set
- shell
- shell-out
- singleton
- sql
  - internal
- str-utils
- str-utils2
- stream-utils
- string
- strint
- swing-utils
- test-is
- trace
- types
- with-ns
- zip-filter
  - xml

1.2.0

1.2.0 permalink

transitive-closure

Returns the transitive closure of a graph. The neighbors are lazily computed.

Note: some version of this algorithm return all edges a->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 (-> g transitive-closure add-loops)

0 Examples top

Source clojure/contrib/graph.clj:81 top

(defn transitive-closure
  "Returns the transitive closure of a graph.  The neighbors are lazily computed.

   Note: some version of this algorithm return all edges a->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 (-> g transitive-closure add-loops)"
  [g]
  (let [nns (fn [n]
              [n (delay (lazy-walk g (get-neighbors g n) #{}))])
        nbs (into {} (map nns (:nodes g)))]
    (struct directed-graph
            (:nodes g)
            (fn [n] (force (nbs n))))))

Vars in clojure.contrib.graph/transitive-closure: defn fn force let struct

Used in 0 other vars

ClojureDocs(beta)

Clojure Contrib

Namespaces

transitive-closure

clojure.contrib.graph

0 Examples top

See Also top

Source clojure/contrib/graph.clj:81 top

Comments top

No comments for transitive-closure. Log in to add a comment.