Pathfinder

A Python pathfinding visualizer for algorithms such as Dijkstra and A*. Includes drawing, save and load features.

Table of Contents

• Features
• Wiki
  • How to use it
  • How it looks

Features

Implemented and to implement

• Grid Generation
• Dijkstra Algorithm
• A* Algorithm
• Breadth-First Search
• Depth-First Search
• Grid Saving
• Grid Loading
• Code Refactoring

Wiki

How to use it

• First things first, navigate to the project directory and run the following command in the console: pip3 install -r requirements.txt
• Execute python3 Pathfinder.py
• Choose a grid size with the Rows and Columns entries
• Click on the Build Grid button to create the grid window
• Draw the source
• Select Destination on the Editing Mode section
• Draw the destination
• Select Wall if you want to draw some walls or Erase if you want to erase some walls
• Select the algorithm you want to test
• Click on the Find Path button to start the algorithm

How it looks

Path found with Dijkstra:

Path found with A*:

Path found with A* on a 100x100 grid:

Path found with A* on a 100x100 grid: