Pathfinding Comparison V1.0.0

Full Changelog: https://github.com/Jitanshu-commits/Pathfinding/commits/1.0.0
### Pathfinding Visualization with Dijkstra's and A _Algorithms*_
This Python program provides a visual representation of Dijkstra's and A* pathfinding algorithms using the Pygame library. The application allows users to interactively set starting and ending points on a grid, draw obstacles, and visualize the process of finding the shortest path from the starting point to the endpoint while avoiding obstacles.

Features:
Simultaneous Pathfinding: Run Dijkstra's and A* algorithms simultaneously to compare their performance.
User Interaction: Set the starting and ending points by clicking on cells. Draw obstacles by holding the left mouse button.
Algorithm Visualization: See the algorithms in action with real-time visualization. Observe the exploration of cells and the final pathfinding result.
Execution Timing: Measure and display the execution time of Dijkstra's and A* algorithms.
How to Use:
Run the program and interact with the grid using the mouse.
Set the starting and ending points, draw obstacles, and press the space bar to execute Dijkstra's and A* algorithms.
Press 'c' to clear the grid and reset points.
### To-Do:
Improve user interface for better clarity and guidance.
Implement more pathfinding algorithms for comparison.
Allow customization of grid size and cell size.
Enhance algorithm visualization with step-by-step details.
README.md
Pygame: Install it using pip install ### pygame.
Feel free to contribute, report issues, or suggest improvements! Happy pathfinding!

---