Skip to content

Releases: devonhollowood/search-algorithms

v0.3.4

Choose a tag to compare

@devonhollowood devonhollowood released this 28 Jun 20:42

What's Changed

  • Add dijkstraAssocCost and dijstraAssocCostM, which make it easier to handle path-dependent costs.
  • Fix bug in dijkstraAssocM, where the prior cost was not propagated to new states.

Full Changelog: v0.3.3...v0.3.4

v0.3.3

Choose a tag to compare

@devonhollowood devonhollowood released this 08 Nov 20:59
d445305

What's Changed

Full Changelog: v0.3.2...v0.3.3

v0.3.2

Choose a tag to compare

@devonhollowood devonhollowood released this 28 Dec 06:53

Add two new functions, dijkstraAssoc and aStarAssoc, which are useful when neighboring states and costs can be simultaneously computed.

v0.3.1

Choose a tag to compare

@devonhollowood devonhollowood released this 20 Aug 06:25
  • Dependency version bump

v0.3.0

Choose a tag to compare

@devonhollowood devonhollowood released this 30 Nov 02:36

Added

  • Monadic versions of search algorithms and helper functions

v0.2.0

Choose a tag to compare

@devonhollowood devonhollowood released this 13 May 08:14

This release marks a major overhaul to the library's interface.

Changed

  • BREAKING CHANGE: Simplified return type of dijkstra and aStar.
    • This should make these functions more ergonomic.
    • Introduced new incrementalCosts function to compensate.
  • BREAKING CHANGE: Replaced searches' prunes arguments with pruning combinator.
  • BREAKING CHANGE: Split searches' next arguments into multiple arguments for dijkstra and aStar.
    • This should make these functions more ergonomic.
  • next arguments now only require a way of generating Foldables, instead of lists specifically.

v0.1.0

Choose a tag to compare

@devonhollowood devonhollowood released this 08 Mar 21:44

This is the initial release.