Releases: Jitanshu-commits/Pathfinding
Swarm Experiment (Updated)
This is an experiment on Swarm intelligence (ACO and PSO) using grids (similar to previous works)
Full Changelog: V1.6.9...V.Swarm
Full Changelog: V1.6.9...V.Swarm
V1.6.9
Pathfinding Visualization with Dijkstra's and A (additions BFS and DFS)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!
### ||Addition (New Releases)
#Added the ability for continuous obstacle generation while holding right click.
#Added two new algorithms BFS(Breadth First Search) and DFS(Depth First Search).
#Added a menu for Algorithm selection.
#Added obstacle removal (right click removes an obstacle)
#Fixes
#Added exception(error) handling for no paths available
#Added random maze (obstacle) generation
#Added hotkeys for each algorithm 1 - A*, 2- Dijkstra, 3-BFS, 4-DFS
#Fixed obstacle removal's grid drawing function.
#Added error handling for no start/end points set.
#Added a slider for Visualization speed.(This version works perfectly!)
#Esc stops the execution(visualization) of the algorithm.
#Changes to colors of Algorithms
#Added the ability to pause visualization with 'P' (pressing 'p' again will resume the visualization process)
#Graphical enhancement for Visualization process
#Caption shows the selected algorithm.
#Added Smooth transition.
#Start and end point png, more graphical improvements(please paste the 'STARTEND'.png at the appropriate place.)
#Ability to resize Grid
Full Changelog: V1.6.4...V1.6.9
V1.6.4
Pathfinding Visualization with Dijkstra's and A (additions BFS and DFS)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!
### ||Addition (New Releases)
#Added the ability for continuous obstacle generation while holding right click.
#Added two new algorithms BFS(Breadth First Search) and DFS(Depth First Search).
#Added a menu for Algorithm selection.
#Added obstacle removal (right click removes an obstacle)
#Fixes
#Added exception(error) handling for no paths available
#Added random maze (obstacle) generation
#Added hotkeys for each algorithm 1 - A*, 2- Dijkstra, 3-BFS, 4-DFS
#Fixed obstacle removal's grid drawing function.
#Added error handling for no start/end points set.
#Added a slider for Visualization speed.(This version works perfectly!)
#Esc stops the execution(visualization) of the algorithm.
#Changes to colors of Algorithms
#Added the ability to pause visualization with 'P' (pressing 'p' again will resume the visualization process)
#Graphical enhancement for Visualization process
#Caption shows the selected algorithm.
#Added Smooth transition.
#Start and end pint png, more graphical improvements(please paste the startend png at the appropriate place.)
V1.6.0
Pathfinding Visualization with Dijkstra's and A (additions BFS and DFS)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!
### ||Addition (New Releases)
#Added the ability for continuous obstacle generation while holding right click.
#Added two new algorithms BFS(Breadth First Search) and DFS(Depth First Search).
#Added a menu for Algorithm selection.
#Added obstacle removal (right click removes an obstacle)
#Fixes
#Added exception(error) handling for no paths available
#Added random maze (obstacle) generation
#Added hotkeys for each algorithm 1 - A*, 2- Dijkstra, 3-BFS, 4-DFS
#Fixed obstacle removal's grid drawing function.
#Added error handling for no start/end points set.
#Added a slider for Visualization speed.(This version works perfectly!)
#Esc stops the execution(visualization) of the algorithm.
#Changes to colors of Algorithms
#Added the ability to pause visualization with 'P' (pressing 'p' again will resume the visualization process)
#Graphical enhancement for Visualization process
Full Changelog: V1.5.5...V1.6.0
V1.5.5
Pathfinding Visualization with Dijkstra's and A (additions BFS and DFS)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!
### ||Addition (New Releases)
#Added the ability for continuous obstacle generation while holding right click.
#Added two new algorithms BFS(Breadth First Search) and DFS(Depth First Search).
#Added a menu for Algorithm selection.
#Added obstacle removal (right click removes an obstacle)
#Fixes
#Added exception(error) handling for no paths available
#Added random maze (obstacle) generation
#Added hotkeys for each algorithm 1 - A*, 2- Dijkstra, 3-BFS, 4-DFS
#Fixed obstacle removal's grid drawing function.
#Added error handling for no start/end points set.
#Added a slider for Visualization speed.(This version works perfectly!)
#Esc stops the execution(visualization) of the algorithm.
#Changes to colors of Algorithms
#Added the ability to pause visualization with 'P' (pressing 'p' again will resume the visualization process)
Full Changelog: V1.5.2...V1.5.5
V1.5.2
Pathfinding Visualization with Dijkstra's and A (additions BFS and DFS)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!
### ||Addition (New Releases)
#Added the ability for continuous obstacle generation while holding right click.
#Added two new algorithms BFS(Breadth First Search) and DFS(Depth First Search).
#Added a menu for Algorithm selection.
#Added obstacle removal (right click removes an obstacle)
#Fixes
#Added exception(error) handling for no paths available
#Added random maze (obstacle) generation
#Added hotkeys for each algorithm 1 - A*, 2- Dijkstra, 3-BFS, 4-DFS
#Fixed obstacle removal's grid drawing function.
#Added error handling for no start/end points set.
#Added a slider for Visualization speed.(This version works perfectly!)
#Esc stops the execution(visualization) of the algorithm.
Full Changelog: V1.5.0...V1.5.2
V1.5.0
Pathfinding Visualization with Dijkstra's and A (additions BFS and DFS)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!
### ||Addition (New Releases)
#Added the ability for continuous obstacle generation while holding right click.
#Added two new algorithms BFS(Breadth First Search) and DFS(Depth First Search).
#Added a menu for Algorithm selection.
#Added obstacle removal (right click removes an obstacle)
#Fixes
#Added exception(error) handling for no paths available
#Added random maze (obstacle) generation
#Added hotkeys for each algorithm 1 - A*, 2- Dijkstra, 3-BFS, 4-DFS
#Fixed obstacle removal's grid drawing function.
#Added error handling for no start/end points set.
#Added a slider for visualization speed.
Full Changelog: V1.4.8...V1.5.0
V1.4.8
Pathfinding Visualization with Dijkstra's and A (additions BFS and DFS)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!
### ||Addition (New Releases)
#Added the ability for continuous obstacle generation while holding right click.
#Added two new algorithms BFS(Breadth First Search) and DFS(Depth First Search).
#Added a menu for Algorithm selection.
#Added obstacle removal (right click removes an obstacle)
#Fixes
#Added exception(error) handling for no paths available
#Added random maze (obstacle) generation
#Added hotkeys for each algorithm 1 - A*, 2- Dijkstra, 3-BFS, 4-DFS
#Fixed obstacle removal's grid drawing function.
#Added error handling for no start/end points set.
Full Changelog: V1.4.7...V1.4.8
V1.4.7
Pathfinding Visualization with Dijkstra's and A (additions BFS and DFS)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!
### ||Addition (New Releases)
#Added the ability for continuous obstacle generation while holding right click.
#Added two new algorithms BFS(Breadth First Search) and DFS(Depth First Search).
#Added a menu for Algorithm selection.
#Added obstacle removal (right click removes an obstacle)
#Fixes
#Added exception(error) handling for no paths available
#Added random maze (obstacle) generation
#Added hotkeys for each algorithm 1 - A*, 2- Dijkstra, 3-BFS, 4-DFS
#Fixed obstacle removal's grid drawing function.
Full Changelog: V1.4.6...V1.4.7
V1.4.6
Pathfinding Visualization with Dijkstra's and A (additions BFS and DFS)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!
||Addition (New Releases)
#Added the ability for continuous obstacle generation while holding right click.
#Added two new algorithms BFS(Breadth First Search) and DFS(Depth First Search).
#Added a menu for Algorithm selection.
#Added obstacle removal (right click removes an obstacle)
#Fixes
#Added exception(error) handling for no paths available
#Added random maze (obstacle) generation
#Added hotkeys for each algorithm 1 - A*, 2- Dijkstra, 3-BFS, 4-DFS
Full Changelog: V1.4.5...V1.4.6