A* Algorithm - Githubissues

codezonediitj / pydatastructs

A python package for data structures and algorithms

https://pydatastructs.readthedocs.io/en/stable/

Other

199 stars 269 forks source link

A* Algorithm #486

Open Gaurika-Gupta opened 2 years ago

Gaurika-Gupta commented 2 years ago

A* Algorithm in Python to find the shortest path between 2 nodes.

Gaurika-Gupta commented 2 years ago

Please add GSSOC'22 label and assign me the Issue.

czgdp1807 commented 2 years ago

Idea is good. Could you please provide more details on how will you implement it? We don't assign issues. Please read, https://github.com/codezonediitj/pydatastructs/wiki/Issue-Policy

aishanii commented 2 years ago

I would like to work on this issue @czgdp1807

I will explain the algorithm first
I will implement the algorithm in code and explain the output visually on the graph

Shivani416 commented 2 years ago

I would like to work on A algorithm on graph, I have implemented it recently in python for my AIML curriculum. @Gaurika-Gupta could you assign it to me? I could also implement A on 8 puzzle in python.

silentspectator20 commented 1 year ago

@czgdp1807 Hello, I would like to work on this issue for GSoC 2023. Can I work on this?

czgdp1807 commented 1 year ago

Sure. Please go ahead @silentspectator20

AdityaMayukhSom commented 5 months ago

I believe implementing A* algorithm between two nodes will require some kind of heuristic function which can be used to evaluate an approximate cost to the goal node from the current node. The heuristic function should also be admissible, otherwise optimal path is not guaranteed.

Should the function A* take the heuristic function as a parameter and assume it to work on the nodes?