Skip to content

Simple web page implementing Dijkstra's algorithm with a Mininum Priority Queue in vanilla Javascript

Notifications You must be signed in to change notification settings

lesmaleinad/pathfinder

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Pathfinder

Simple web page implementing Dijkstra's algorithm with a Mininum Priority Queue in vanilla Javascript

  • Options for the size and cost of each node
  • Supports arbitrary neighbors (for now, only diagonal and 4 sides)

About

Simple web page implementing Dijkstra's algorithm with a Mininum Priority Queue in vanilla Javascript

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published