Skip to content

Commit d19288a

Browse files
committed
Added entry for version 0.5.1.
1 parent 90d5607 commit d19288a

1 file changed

Lines changed: 8 additions & 0 deletions

File tree

CHANGELOG.md

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,12 @@
11

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+
210
## 0.5.0
311
- *Breaking changes*:
412
The following *getters have been converted to functions*, to

0 commit comments

Comments
 (0)