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

doc source examples comments

1.2.0

1.2.0 permalink

add-loops

clojure.contrib.graph

(add-loops g)

For each node n, add the edge n->n if not already present.

0 Examples top

Source clojure/contrib/graph.clj:49 top

(defn add-loops
  "For each node n, add the edge n->n if not already present."
  [g]
  (struct directed-graph
          (:nodes g)
          (into {} (map (fn [n]
                          [n (conj (set (get-neighbors g n)) n)]) (:nodes g)))))

Vars in clojure.contrib.graph/add-loops: defn fn into map struct

Used in 0 other vars

ClojureDocs(beta)

Clojure Contrib

Namespaces

add-loops

clojure.contrib.graph

0 Examples top

See Also top

Source clojure/contrib/graph.clj:49 top

Comments top

No comments for add-loops. Log in to add a comment.