Algorithm Descriptions

BFS (Breadth-First Search)

BFS explores nodes level-by-level, radiating out from the starting point. It guarantees the shortest path in an unweighted graph or grid.

DFS (Depth-First Search)

DFS dives deep into one direction before backtracking, exploring as far as possible along each branch. It doesn't guarantee the shortest path in a grid environment.

Dijkstra's Algorithm

Dijkstra's algorithm finds the shortest path between two points on a grid. It smartly picks the closest spot to start from and keeps going. In our project, we show just the quickest route at the end. That's why it looks super fast, especially when the path is straightforward.