From f05d8fc0fa970d27f6bc20ea90b84754347f095d Mon Sep 17 00:00:00 2001 From: Jim Riecken Date: Mon, 10 Feb 2020 20:58:07 -0800 Subject: [PATCH] Release 0.9.0 --- CHANGELOG.md | 6 ++++++ package.json | 2 +- 2 files changed, 7 insertions(+), 1 deletion(-) diff --git a/CHANGELOG.md b/CHANGELOG.md index 934fec7..9257248 100644 --- a/CHANGELOG.md +++ b/CHANGELOG.md @@ -1,5 +1,11 @@ # Dependency Graph Changelog +## 0.9.0 (February 10, 2020) + +- Rewrite the topological sort DFS to be more efficient (and work!) on large graphs. + - No longer uses recursion to avoid stack overflows with large/deep graphs + - No longer is accidentally `O(N^2)` (thanks [willtennien](https://github.com/willtennien) for pointing this out!) + ## 0.8.1 (December 3, 2019) - Ensure all nodes are included in overallOrder when cycles are allowed. (Fixes #33) diff --git a/package.json b/package.json index e36ab09..9b34216 100644 --- a/package.json +++ b/package.json @@ -1,7 +1,7 @@ { "name": "dependency-graph", "description": "Simple dependency graph.", - "version": "0.8.1", + "version": "0.9.0", "author": "Jim Riecken ", "keywords": [ "dependency",