javascript-astar

javascript-astar copied to clipboard

fewest turns

1

is there a way to pass option which would set a penalty if the path changes directions in order to get a path with fewest turns? (I need to avoid...

goozo

I was reusing a graph to find multiple paths and hit the (closed) issue #43, which was fixed by the most recent commits. Those commits didn't make it into an...

mikewesthad

経路の斜め移動の重みを等倍に修正。 ESLintによる構文チェック。

takenaoki

Add clearance detection and option in search method

1

Hi, To move character bigger than 1x1 tile, I had to write a clearance detection. The clearance of each Node is stored at the Graph init, and we can use...

wibimaster

This badge will show the version on CDNJS.

kaocy

algorithm fails for a particular case - cell marked with magenta color (PFA image)

2


deveedutta

Can't find a path after a few search

3

currentNode.closed = true and didn't make it dirty so that when a new search begins, the function Graph.cleanDirty() may not reset the closed node, and finally it will result in...

wallpap3r

Diagonal heuristic computes square root of 2 every time it is used

1

Would help performance to do this as a constant outside the function.

peterjwest

cached this.content and this.socreFunction ( faster 7.5%), and have s…

11

I optimized the Binary Heap in a few ways : • cached the properties that were used several times, content and scoreFunction ( 7.5% faster). • cached scoreElement in sinkDown...

gamealchemist

I was playing around with the Web version hosted by the author, and found that every time a new map is generated, the diagonal path check box has to be...

quintopia