https://github.com/aslandevbrat/implement-route-planner-using-a-algorithm
4 th Project of Udacity Data Structure and Algorithm course
https://github.com/aslandevbrat/implement-route-planner-using-a-algorithm
Last synced: 13 days ago
JSON representation
4 th Project of Udacity Data Structure and Algorithm course
- Host: GitHub
- URL: https://github.com/aslandevbrat/implement-route-planner-using-a-algorithm
- Owner: AslanDevbrat
- Created: 2020-08-19T10:07:48.000Z (almost 6 years ago)
- Default Branch: master
- Last Pushed: 2020-08-19T10:19:40.000Z (almost 6 years ago)
- Last Synced: 2025-10-20T09:32:52.535Z (9 months ago)
- Language: Jupyter Notebook
- Size: 18.6 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
## Explanation:
This project is on implement the A* algorithm to find the route between two node in a given graph.
I used a minHeap to keep track of the optimal node. minHeap also time efficient. Time complexity for adding an element to minHeap is O(logn).
I have taken heuristic as the ecludian distance between two nodes.
In order to see the algorithm work download this repository and run the project_notebook.ipynb file in jupyter notebook. The actual implementation is in the student_code.py Major test cases are in the test.py file