graphs
Graph algorithms that operate on graphs in any representation.
2.3.2
7.6M downloads/mo
#76 most downloaded on pub.dev
dart-lang/tools
What this package is like to depend on
Last release 2 years ago
no release in 18 months
Release timing varies
gaps range from 2 weeks to 2.2 years
Nearly every release is documented
notes for 14 of 14 stable releases
Nothing withdrawn
no release was ever pulled
9 years old
14 releases · first in 2017
0 releases in the last 12 months
see the full history below
Release timeline
14 releases · Dec 2017 to Jul 2024
2018
2019
2020
2021
2022
2023
2024
2025
2026
Releases
latest 14-
2.3.218 Jul 2024Release notes
Open source →- Require Dart 3.4
- Update to the latest version of
package:dart_flutter_team_lints.
-
2.3.124 May 2023 -
2.3.010 May 2023Release notes
Open source →- Add a
transitiveClosurefunction. - Make
stronglyConnectedComponentsandtopologicalSortiterative rather than recursive to avoid stack overflows on very large graphs. - Require Dart 2.18
- Add a
-
2.2.021 Oct 2022Release notes
Open source →- Add a
secondarySortparameter to thetopologicalSort()function which applies an additional lexical sort where that doesn't break the topological sort.
- Add a
-
2.1.014 Sep 2021 -
2.0.019 Mar 2021Release notes
Open source →- Breaking:
crawlAsyncwill no longer ignore a node from the graph if thereadNodecallback returns null.
- Breaking:
-
1.0.026 Feb 2021Release notes
Open source →- Migrate to null safety.
- Breaking: Paths from
shortestPath[s]are now returned as iterables to reduce memory consumption of the algorithm to O(n).
-
0.2.012 Dec 2018Release notes
Open source →- BREAKING
shortestPath,shortestPathsandstronglyConnectedComponentsnow have one generic parameter and have replaced thekeyparameter with optional params:{bool equals(T key1, T key2), int hashCode(T key)}. This follows the pattern used indart:collectionclassesHashMapandLinkedHashMap. It improves the usability and performance of the case where the source values are directly usable in a hash data structure.
- BREAKING
-
0.1.307 Nov 2018Release notes
Open source →- Added
shortestPathandshortestPathsfunctions. - Use
HashMapandHashSetfromdart:collectionforstronglyConnectedComponents. Improves runtime performance.
- Added
-
0.1.3+108 Nov 2018 -
0.1.223 Apr 2018Release notes
Open source →crawlAsyncsurfaces exceptions while crawling through the result stream rather than as uncaught asynchronous errors.
-
0.1.2+118 Jul 2018 -
0.1.118 Apr 2018 -
0.1.007 Dec 2017Release notes
Open source →- Initial release with an implementation of
stronglyConnectedComponentsandcrawlAsync.
- Initial release with an implementation of