Just Dag
We have improved the performance and simplified the API somewhat. We removed the simple graph class DependantGraph and instead replicated all that functionality into Dag. We added a Cache[K, V]
which is a snapshot-able (immutable Map[K, V]
backed) cache which is useful in memoizing recursive graph transformations on DAGs.
Changes
- #7 the main change: rename ExpressionDag to Dag, add Cache as an analog to HCache, move DependantGraph to a test, since all functionality is subsumed by Dag.
- #9 add Dag.applySeq to apply a
Seq[Rule[N]]
sequentially, which is commonly what you want.