Path Finder

Key Features

• Obstacle Avoidance: You can add obstacles(walls) in the grid. The algorithm avoid obstacles in the grid and find the shortest path.
  (Note - Not all algorithms guarantees shortest path)
• Real-time Path Visualization: Move source or destination points to see the updated path in near real time.
• Reset: Reset the grid to its initial state or clear the obstacles(walls).

Technical Implementation

• Built using React.js.
• Provides a list of algorithms to find the path between two points in a 2d grid.
  • Breadth First Search (BFS) - Guarantees shortest path.
  • Depth First Search (DFS) - Does not guarantee shortest path.
  • Dijkstra's Algorithm - Guarantees shortest path.
  • A * Algorithm - Guarantees shortest path.