My understanding is that BFS and DFS are graph traversing algorithm while other algorithms like A* and dijkstra are for finding shortest path between two nodes
I'm working currently on a indoor pathfinding project. You can imagine it like this: enter image description here In my application i have two searchviews for
I am looking for an algorithm to fidn the longest path between two points on a grid, with the added restriction that you cannot revisit a cell on the grid. (Als
cloud