Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Optimised route finding using Graph Algorithms #7922

Open
ishwariiic opened this issue Oct 19, 2024 · 3 comments
Open

Optimised route finding using Graph Algorithms #7922

ishwariiic opened this issue Oct 19, 2024 · 3 comments

Comments

@ishwariiic
Copy link

The issue involves finding the most efficient path between two points (nodes) in a network of interconnected locations (graph) and implementing it in road networks. I will be using Djikstra's algorithm, A*star algorithm and bellman ford algorithm, and also optimising them with traffic parameters to suggest the shortest path.

@fineanmol
Copy link
Owner

@ishwariiic Please Star ⭐️ the repo to earn 'hacktober-accepted' label for the event.\nMeanwhile, if you want to work on this issue, please raise a PR, and we will review and merge it.

@ishwariiic
Copy link
Author

Raised a PR and submitted it

@ManeVaishnu
Copy link

Hi @ishwariiic, I am interested to contribute in this project, please assign it to me

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants