marcelo-s / a-star-java-implementation Goto Github PK

I like this implementation a lot. It was very easy and slick to put inside my own code.

Would you consider adding support for individual node movement cost? That would make this implementation even better.

First of all thanks for this implementation.
I would just suggest you to change the implementation of the closedList to an HashSet which performs lot more efficiently the contain operation. In a bigger graph (say thousand nodes), the performance gap is already visible.
Best