Update dependency-graph to the latest version 🚀

[greenkeeper]

The dependency dependency-graph was updated from 0.8.1 to 0.9.0.

This version is not covered by your current version range.

If you don’t accept this pull request, your project will work just like it did before. However, you might be missing out on a bunch of new features, fixes and/or performance improvements from the dependency update.

---

Publisher: jriecken
License: MIT

Release Notes for 0.9.0

• 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 for pointing this out!)

Commits

The new version differs by 3 commits.

• f05d8fc Release 0.9.0
• fc6cf8f Merge pull request #36 from jriecken/fix-perf
• 258c7e7 Rewrite the topological sort DFS to be more efficient

See the full diff

---

FAQ and help

There is a collection of frequently asked questions. If those don’t help, you can always ask the humans behind Greenkeeper.

---

Your Greenkeeper bot 🌴

[coveralls]

Coverage remained the same at 76.316% when pulling eaeee41 on greenkeeper/dependency-graph-0.9.0 into 459cc48 on master.