We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
Implement Dijkstra's (source) algorithm for the map package.
map
Here: https://github.com/dojoengine/origami/tree/main/crates/map/src/helpers
No response
Currently the A* algorithm is implemented, having the choice to use different algorithm for specific cases could be interesting.
Try to match the A* trait for the high level usage, such as:
fn search(grid: felt252, width: u8, height: u8, from: u8, to: u8) -> Span<u8>
The text was updated successfully, but these errors were encountered:
I could do this at some point after the residency if no one has by then
Sorry, something went wrong.
bengineer42
No branches or pull requests
Feature Request
Implement Dijkstra's (source) algorithm for the
map
package.Here: https://github.com/dojoengine/origami/tree/main/crates/map/src/helpers
Proposed Solution
No response
Alternatives
No response
Related Code
No response
Additional context
Currently the A* algorithm is implemented, having the choice to use different algorithm for specific cases could be interesting.
Try to match the A* trait for the high level usage, such as:
If the feature is accepted, would you be willing to contribute it?
The text was updated successfully, but these errors were encountered: