Skip to content

Given a pixel map, this algorithm finds the shortest possible path between two points

Notifications You must be signed in to change notification settings

mo-gaafar/wavefront-pathfinding

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

21 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Wavefront pathfinding maze solver

Given a pixel map, this algorithm finds the shortest possible path between two points using wavefront algorithm.

Features

  • Finds the shortest path between two points
  • Randomly generates mazes
  • Low memory usage and fast execution
  • Can be used to solve any maze

Documentation

The report is available here

How to run

  1. Install Python 3

  2. Create a virtual environment

    python3 -m venv ./venv
  3. Activate the virtual environment

    ./venv/scripts/activate
  4. Install the requirements

    pip install -r requirements.txt
  5. Run the program

    python main.py

Team Members

Member Name GitHub Username
Aly Khaled @alykhaled
Mariam Aly @MariaamAly
Maryam Moataz @MaryamMoataz
Mohamed Nasser @mo-gaafar

About

Given a pixel map, this algorithm finds the shortest possible path between two points

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages