This Python Project provides a graphical user interface (GUI) for visualizing various pathfinding algorithms on a grid. It allows users to interactively set start and end points, draw obstacles, and visualize the process of finding the shortest path between the start and end points using different algorithms.

• Python 3.x
• Pygame library

1. Clone the repository:

   git clone https://github.com/saadarazzaq/algorithmic-hub.git

2. Install Requirements:

   pip install -r requirements.txt

1. Run the script:

   python main.py

2. Use the mouse to interact with the grid:

   • Left-click to add obstacles or set start/end points.
   • Right-click to remove obstacles or reset the grid.
   • Press spacebar to start the pathfinding algorithm.
   • Press 'C' to clear the grid.

3. Choose the desired pathfinding algorithm from the dropdown menu in the GUI.

4. Visualize the process of finding the shortest path between the start and end-points.

The following pathfinding algorithms are supported:

• A* Algorithm
• Best First Search
• Breadth First Search
• Depth First Search
• Uniform Cost Search
• Depth Limited Search
• Iterative Deepening Search
• Bidirectional BFS
• Dijkstra Algorithm

You can customize the grid size, animation speed, and other parameters by modifying the script variables directly.

• This project was inspired by the need for a visual representation of pathfinding algorithms.
• Thanks to the Pygame community for providing the graphics library used in this project.