Smart Path Finder 🚀

A comprehensive graph visualization tool that demonstrates pathfinding algorithms including BFS, DFS, and Dijkstra's Algorithm. Built with Python and Pygame for educational purposes in Data Structures and Algorithms.

Features

• Interactive Graph Visualization: Click to select start and goal nodes
• Multiple Algorithms: BFS, DFS, and Dijkstra's Algorithm
• Real-time Path Highlighting: Visual representation of found paths
• Algorithm Comparison: See how different algorithms solve the same problem
• Educational Tool: Perfect for understanding graph traversal concepts

Algorithms Implemented

1. BFS (Breadth-First Search)

   • Finds shortest path in unweighted graphs
   • Guarantees minimum number of hops

2. DFS (Depth-First Search)

   • Explores deeply before broadly
   • Useful for path existence checking

3. Dijkstra's Algorithm

   • Finds shortest path in weighted graphs
   • Guarantees minimum cost path

Project Structure