huntwj / a-star-for-async-data Goto Github PK

Currently all tests use a zero-heuristic and mimic the Dijkstra algorithm. We need tests that add a heuristic component.

• Ensure path is correct.
• Ensure "good" nodes are visited.
• Ensure "bad" nodes are not visited.

This would be fine if we only supported node-to-node navigation. But since we also allow for a goalFunc on a per-search basis, the heuristic needs to be customizable per search as well.

When the goalFunc is not a func, it should be passed to the h func as a second parameter?

var searchEngine = new Astar({
    // establish callbacks
});
.
.
searchEngine.findPath(start, goalFunc, hFunc).then(function (path) {...});