A* Algorithm

[Gaurika-Gupta]

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

[Gaurika-Gupta]

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

[czgdp1807]

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]

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]

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]

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

[czgdp1807]

Sure. Please go ahead @silentspectator20

[AdityaMayukhSom]

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?