Skip to content

A dijkstra path-finding algorithm wrapped in an Electron js executable

Notifications You must be signed in to change notification settings

Andrew-McCall/electronPathFinder

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

40 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Electron Path Finder

Description

My second electron project. Using my base from my first project (Game Of Life), I made a new editor and wrote an A* path finding algorithm.

A* is a searching algorithm that tries to calculate the shortest distance between two points. It uses the current point's distance from the goal to focus it's checks.

The light pink pixels are the shortest,
The grey pixels have been completed as their Neighbours have been checked (Animation only),
The black pixels are impassible "walls",
The Green is the start,
The Red is the goal

Technologies

  • Electron / npx Electron-Packager
  • JavaScript
  • Canvas (JS)
  • HTML/CSS

Images

New Animation Slider Demo

Variable Animation Speed

New Default Page Searched (After Page Resize)

New Default

Editor and Animation Demo

Gif Of using the app

Example Of A Maze Searched

Maze Search

Download Package

Package Download

Unzip and run AStar.exe in the folder. Uses electron and is built for Windows x64.

Don't trust random .exe from the web

Future Improvements

  • Resize Width
  • Default Drawing
  • Recursive Path Backtrack
  • Variable Animation Speed
  • (Grey Searched Pixels Without Animation)
  • Save Drawing / Load Drawing

Licence

MIT License

Copyright (c) 2022 Andrew McCall