gen-directed-graphgenerator for random directed graphs, which may contain cycles.gen-undirected-graphgenerator for random undirected graphs.gen-weightedgenerator that decorates the edges of a graph with non-negative integer weights.
- Edge probabilities are now sampled uniformly from [0.0, 1.0]. Previously
the underlying
gen/double*biased heavily toward small values, which made generated graphs skew sparse — e.g., the fully-connected directed graph on three vertices occurred with probability ~10⁻⁸ instead of the intended 1/64. gen-ancestor-closed-subgraphnow shrinks toward the smallest allowed subgraph (or:minimum-vertex-count) rather than toward the full input graph, so failing cases minimize to a small counterexample.
- Renamed
gen-pruned-directed-acyclic-graphtogen-ancestor-closed-subgraphto name the invariant it guarantees. The old name is retained as a deprecated alias. gen-ancestor-closed-subgraphnow preserves weighted edges on its input, so it composes withgen-weightedin either order.- Updated Clojure dependency from 1.10.1 to 1.10.2
- Updated test.check dependency from 0.10.0 to 1.1.0
- Updated Clojure dependency from 1.10.0 to 1.10.1
- Updated test.check dependency from 0.9.0 to 0.10.0
- Named all functions. This will cause them to show up properly in stacktraces.
- ClojureScript support
- API reference published to cljdoc.org on each release
- First release, with generators for DAGs, topological orderings, and pruned DAGs.