diff options
| author | Jeffrey Straszheim <straszheimjeffrey@gmail.com> | 2009-02-24 05:06:14 +0000 |
|---|---|---|
| committer | Jeffrey Straszheim <straszheimjeffrey@gmail.com> | 2009-02-24 05:06:14 +0000 |
| commit | 6d533c7127a448cce14cc29c1482bcdc6becedab (patch) | |
| tree | 6859d9fae2b5cd98e5c7836bf522b697ab567d8b /src | |
| parent | 532e573cfb607135f831eace5673bc0e2a8bd9d6 (diff) | |
Fixed comment
Diffstat (limited to 'src')
| -rw-r--r-- | src/clojure/contrib/graph.clj | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/clojure/contrib/graph.clj b/src/clojure/contrib/graph.clj index 94199893..7508f3ea 100644 --- a/src/clojure/contrib/graph.clj +++ b/src/clojure/contrib/graph.clj @@ -82,7 +82,7 @@ "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 all the edges of the prior graph." + be the union of the corresponding edges of the prior graph." [g] (let [sccs (scc g) find-node-set (fn [n] |