We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 90d5607 commit d19288aCopy full SHA for d19288a
1 file changed
CHANGELOG.md
@@ -1,4 +1,12 @@
1
2
+## 0.5.1
3
+- The graph `length` is now calculated using an efficient length iterable
4
+ (the keys of the map storing the graph edges).
5
+ The function `reachableVertices` is not based on a recursive algorithm that
6
+ is speeds up execution time.
7
+- Extended the definition of a quasi-topological ordering.
8
+- Lowered the required SDK version to ^3.5.0.
9
+
10
## 0.5.0
11
- *Breaking changes*:
12
The following *getters have been converted to functions*, to
0 commit comments