Visualization of Path Finding Algorithms

Application for the visualization of Path Finding Algorithms, implemented using Python and PyQt5. The following algorithms are implemented:

• Breadth First Search
• Depth First Search
• Dijkstra's Algorithm
• A* Algorithm, using the heuristics:
  • Euclidean distance
  • Manhattan distance

The pathfinding algorithms are visualized on a 64×64 grid, as shown below. The coordinates of the start and ending points can be manually specified, or randomly selected. The generation of random mazes is supported (the mazes are generated with the use of the Depth First Search algorithm).

Application screenshot	Maze generation

Examples in maze

A* (Euclidean distance)	A* (Manhattan distance)	Breadth First Search	Depth First Search

Examples in empty grid

A* (Euclidean distance)	A* (Manhattan distance)	Breadth First Search	Depth First Search