ALGORITHMIC HUB | AI SEMESTER PROJECT PREVIEW
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.
✅Instructions to Play with this Project:
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.
👉Choose the desired pathfinding algorithm from the dropdown menu in the GUI.
✅Visualize the process of finding the shortest path between the start and end-points.
👉Supported Algorithms:
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
Source Code: https://github.com/SaadARazzaq/algori...