graphs 2.0.0 copy "graphs: ^2.0.0" to clipboard
graphs: ^2.0.0 copied to clipboard

Published 4 years ago • verified publishertools.dart.dev• Latest: 2.3.2
outdated
→

Metadata

Graph algorithms that operate on graphs in any representation

More...

2.0.0 #

  • Breaking: crawlAsync will no longer ignore a node from the graph if the readNode callback returns null.

1.0.0 #

  • 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.0 #

  • BREAKING shortestPath, shortestPaths and stronglyConnectedComponents now have one generic parameter and have replaced the key parameter with optional params: {bool equals(T key1, T key2), int hashCode(T key)}. This follows the pattern used in dart:collection classes HashMap and LinkedHashMap. It improves the usability and performance of the case where the source values are directly usable in a hash data structure.

0.1.3+1 #

  • Fixed a bug with non-identity key in shortestPath and shortestPaths.

0.1.3 #

  • Added shortestPath and shortestPaths functions.
  • Use HashMap and HashSet from dart:collection for stronglyConnectedComponents. Improves runtime performance.

0.1.2+1 #

  • Allow using non-dev Dart 2 SDK.

0.1.2 #

  • crawlAsync surfaces exceptions while crawling through the result stream rather than as uncaught asynchronous errors.

0.1.1 #

  • crawlAsync will now ignore nodes that are resolved to null.

0.1.0 #

  • Initial release with an implementation of stronglyConnectedComponents and crawlAsync.

← Metadata

134
likes
0
points
4.36M
downloads

Publisher

verified publishertools.dart.dev

Weekly Downloads

Metadata

Graph algorithms that operate on graphs in any representation

Repository (GitHub)
View/report issues

License

unknown (license)

More

Packages that depend on graphs

Back