Skip to content

TMalicki/PathFinder-algorithms

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

57 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

PathFinder-algorithms

Description This program shows working algorithms (for now: Breadth First Search, Greedy, A*). It allows to create board inside editor mode, and than run any of available algorithms. Console window shows what algorithm will be executed and after it ends time is given.

Image

Instruction color of nodes meaning

  • green - starting node
  • red - finish node
  • black - obstacle nodes
  • violet - nodes in openList (not visited yet)
  • gray - nodes in closedList (already visited)
  • blue - best, calculated path

Control

  • left mouse button - for add node on board (respectively - finish node, start node, obstacles nodes*), hold it while putting obstacle nodes for possibility of "drawing" on board (multi selection mode)
  • right mouse button - for delete any node
  • scroll mouse button - for choosing between algorithms
  • E key - for return to edit mode after executed algorithm
  • enter - to run algorithm

Functionalities:

  • 2D editor for pathfinder
  • breadth first search algorithm
  • greedy algorithm
  • A* algorithm

ToDo

  • compare algorithms options with two algorithms working in the same time

ToFix

  • optimize code - ** add another container for nodes**

  • some display changes

    Image Image Image


    Image Image Image

About

Visualization of some path finding algorithms. Written in c++ with use of SFML for graphic handling.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages