Skip to content

A*, greedyBFS, Dijkstra path visualization written in C++ using SFML 2.5.1

Notifications You must be signed in to change notification settings

082T/Path-Visualization-SFML

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

28 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Path-Visualization-SFML

A*, greedyBFS, Dijkstra path visualization written in C++ using SFML 2.5.1

Buttons:

  • A* - executes the Astar algorithm
  • greedyBFS - executes the greedy best-first search algorithm
  • Dijkstra - executes Dijkstra's algorithm
  • Soft Clear - cleans tiles changed by used algorithm
  • Clear - cleans all tiles in the grid
  • Start - enables choosing the starting block by clicking on the grid
  • Obstacle - enables placing obstacle blocks by left-clicking on the grid and removing blocks by right-clicking on the grid
  • End - enables choosing the ending block by clicking on the grid
Path-viz.mp4

image

To compile and run (visual studio 2019):

  • Pull the files into project folder
  • Download SFML
  • Copy .dll files into the folder containing project executable
  • Change project mode to Release x64
  • Add SFML\include to C/C++ -> General -> Additional Include Directories
  • Add SFML\lib to Linker -> General -> Additional Library Directories
  • Add sfml-graphics.lib, sfml-window.lib, sfml-system.lib to Linker -> Input -> Additional Dependencies
  • Run the program

About

A*, greedyBFS, Dijkstra path visualization written in C++ using SFML 2.5.1

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages