pydatastructs icon indicating copy to clipboard operation
pydatastructs copied to clipboard

Published 20 hours ago • verified publisher icon codezonediitj

A* Algorithm

Open Gaurika-Gupta opened this issue 2 years ago • 7 comments

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

Gaurika-Gupta avatar Mar 01 '22 12:03 Gaurika-Gupta

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

Gaurika-Gupta avatar Mar 01 '22 12:03 Gaurika-Gupta

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

czgdp1807 avatar Mar 02 '22 07:03 czgdp1807

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

aishanii avatar Mar 07 '22 09:03 aishanii

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.

Shivani416 avatar Mar 15 '22 11:03 Shivani416

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

silentspectator20 avatar Mar 21 '23 14:03 silentspectator20

Sure. Please go ahead @silentspectator20

czgdp1807 avatar Mar 21 '23 16:03 czgdp1807

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?

AdityaMayukhSom avatar Jan 08 '24 15:01 AdityaMayukhSom