A* algorithm?

[marcofugaro]

Hey! This repo is awesome! Nice job!

While I was reading through the algorithms, I found weird that the A* algorithm was missing, which is one of the few I know.

I'm just gonna leave this as a suggestion, sorry if I can't do a pull request!

[trekhleb]

Hi @marcofugaro

Thank you for suggestion!

Yes let's have it as an issue here and I will treat it as item from requested algorithms queue. I've created a label for that. So once I'll have a chance I'll implement it (or may be any other developer will volunteer)

[dani4453]

Hello @trekhleb

I willing to contribute the project, so I would like to take this problem. As a newcomer I don't know how much time I have to complete the task so I will like to know.

Thank you.

[trekhleb]

@dani4453 great! It would be nice to have your contribution!

[amatiasq]

I have a A* algorithm in my https://github.com/amatiasq/pathfinding repo, but I'm not an expert. I can clean it up for this.

[thwee-alchemist]

Hi. I'm on my phone so I can't do a pull request, but I recently implemented A*, feel free to copy it... https://github.com/thwee-alchemist/A_Star

[Martin-Pitt]

What about the pathfinding algorithms and also optimised data structures from: https://github.com/anvaka/ngraph.path ?

It seemed really interesting project to me, both from algorithms for pathfinding and also modified data structures for performance in JS.

@anvaka what are your thoughts?

[shubham2704]

Hello @trekhleb

I want to contribute to this repo. I have implemented few path finding algorithms like dijkstra algorithm,A* and etc.
but i have noticed so much activity that's why asking before creating pull request.

[nyngwang]

@trekhleb I can provide my implementation of IDA* (assume the answer to the following question is be "No")

What about the pathfinding algorithms and also optimised data structures from: https://github.com/anvaka/ngraph.path ?

@Martin-Pitt Look nice! Does it include IDA*? So I don't need to implement it again, lol.

by a random person who was fascinated by iterative deepening A* path finding algo.(100+hours spent)

[MysteryManav]

I would like to work on this, can you please clear the following:

1. In which folder in "algorithms" do you want the implementation
2. Do I have to explain in detail the A* Algorithm in the README file for the A*
3. Can i link some resources(youtube videos, articles, etc.) that i find better for understanding or just images explaining the algorithm and the explaination in words itself

Thanks