You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
A data structure for representing dependency graphs in Clojure.
This library provides a basic implementation of a directed acyclic
graph (DAG) data structure, represented as a pair of maps. It is
immutable and persistent.
Nodes in the graph may be any type which supports Clojure's equality
semantics such as keywords, symbols, or strings.
I originally developed this library to support namespace dependency
tracking in tools.namespace, where it is still included under the
name clojure.tools.namespace.dependency.
I am releasing this library independently so that other projects can
use it without adding a dependency on all of tools.namespace.
Releases and Dependency Information
This library is released on Clojars. Latest release is 0.1.0.
Refer to the docstrings for more API documentation. Refer to the tests
for more examples.
Development and Contributing
Please send bug reports or suggestions via email, which you can find
on my GitHub profile.
Please feel free to fork and modify this library, but please do not
send me pull requests without some prior correspondence.
Change Log
Release 0.1.0
Copyright and License
Copyright (c) Stuart Sierra, 2013. All rights reserved. The use and
distribution terms for this software are covered by the Eclipse Public
License 1.0 (https://opensource.org/licenses/eclipse-1.0.php) which can
be found in the file epl-v10.html at the root of this distribution. By
using this software in any fashion, you are agreeing to be bound by
the terms of this license. You must not remove this notice, or any
other, from this software.
About
A data structure for representing dependency graphs in Clojure