Skip to content

Latest commit

 

History

History
33 lines (22 loc) · 733 Bytes

README.md

File metadata and controls

33 lines (22 loc) · 733 Bytes
Raw

A* path finding algorithm visualizer

This is a simple visualizer for an A* path finding algorithm written in V.

Quick start

# to run:
$ v run aStar.v

# to just compile:
$ v aStar.v

# then to run:
$ ./aStar

Controls

  • q : To quit the application
  • c: clear the grid and start from new one
  • space: initialize path finding algorithm

Demo

Demo image of the algorithm

🔴🔴🔴🔴 Area of improvments 🔴🔴🔴🔴🔴

  • 🚧 Under Construction: We are using heap, but that is not correctly implemented, since instead of O(log(n)) it takes O(n). For that reason, having a bigger grid size, will break the application.

  • 🌱 Growth Opportunity: make it responsive.