[Feature]: Depth-first search pathfinding algorithm

[bal7hazar]

Feature Request

Implement DFS (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:

fn search(grid: felt252, width: u8, height: u8, from: u8, to: u8) -> Span<u8>

If the feature is accepted, would you be willing to contribute it?

• [ ] Yes I would be willing to contribute

[guha-rahul]

I would like to work on it if its avaliable, although its gonna take some time.

[bal7hazar]

@guha-rahul any advancement?

[guha-rahul]

@bal7hazar extremely sorry for the delay, i faced some issue i think it will be solved in a day or two.