Hipster Versions Save

Hipster4j is a lightweight and powerful heuristic search library for Java and Android. It contains common, fully customizable algorithms such as Dijkstra, A* (A-Star), DFS, BFS, Bellman-Ford and more.

v1.0.1

7 years ago

Full Changelog

Fixed bugs:

  • open queue does not manage repeated elements #170

Closed issues:

  • Add heuristic to maze example #165
  • Implementation of Annealing localsearch #158

v1.0.0

8 years ago

Full Changelog

Implemented enhancements:

  • Complete javadoc documentation for hipster.algorithm.problem (core) #5
  • Complete javadoc documentation for hipster.algorithm.multiobjective (core) #4
  • Add a depth or path size attribute to nodes #140
  • Replace Stack with ArrayDeque #137
  • Detect negative cycle conditions in BellmanFord #136
  • Update scripts to auto-generate javadocs for snapshot versions #121

Fixed bugs:

  • When Search Result printed Action list is now in reverse order (in v1.0.0.rc2 vs v1.0.0.rc1) #141
  • Fix coveralls maven plugin #131

Closed issues:

  • Update gitignore file to include Eclipse editor files #146
  • When checking if point in bounds, also check lower bounds. #144
  • Integration with codecov.io #152
  • Replace Cobertura with JaCoCo #151
  • Change maven compiler version to 1.6 #150
  • Fix incorrect URL for javadoc publication #149
  • Remove unused citius-nexus-snapshot in maven-settings.xml #148
  • Upgrade config to deploy on bintray #143
  • Show unit time (ms) in algorithm result toString() method #139
  • Detect "NoSuchElementException" situations in AbstractIterator #138

Merged pull requests:

v1.0.0-rc2

8 years ago

Change Log

Full Changelog

Implemented enhancements:

  • Fix deploy script to deploy only SNAPSHOT versions #111
  • Update travis.yml to use the new container-based CI #135
  • StateTransitionFunction is not lazy #134
  • LazyActionStateTransitionFunction is not lazy #133
  • LazyNodeExpander is not lazy #132
  • Create a branch whitelist in travis.yml #129
  • Refactor the basic (non-guava) graph implementations and improve unit tests #128
  • Confusing usage of the GraphBuilder #119
  • Remove dependencies with Guava from hipster-core #113 (now is only 150 kb)

Fixed bugs:

  • Java <1.8 Incompatibility #130
  • BellmanFord iterator search method fails #127
  • NullPointerException using Bellman-Ford algorithm #124
  • RomaniaaProblemOptimalSearchTest does not detect solutions with different length #123
  • AD* node expander check isConsistent() after node.g and node.v changed #122
  • assert check in BinaryOperation constructor done with equals\(\) instead of compare\(\) #120
  • restrictive type in ProblemBuilder(...)defineProblemWithoutExplicitActions().useTransitionFunction() #115
  • change visibility of attributes and methods in Algorithm subclasses #114
  • AbstractNode.path() in reversed order #72
  • Method search(SearchListener) from Algorithms does not stop #49

Closed issues:

  • Create new module "hipster-extensions" with classes depending on Guava #125
  • Update site.url in parent pom.xml #126
  • hipster.version in branch development should not be the same than last release #118
  • hipster.version defined in root pom.xmi but not used #117
  • Implement common tests for heuristic search algorithms #71

* This Change Log was automatically generated by github_changelog_generator

v1.0.0-rc1

9 years ago

First release candidate of the library

v1.0.0-alpha-1

9 years ago

Initial (alpha) version of Hipster. This version does not support explicit actions. API may change, no backward compatibility guaranteed in future releases. This is the API version used in different research projects.