oguztecirlioglu / pathfinding-algorithm-visualiser-sfml Goto Github PK
View Code? Open in Web Editor NEWA semi-pretty (somewhat) visualisation of Dijkstra's Algorithm on a 2-D grid. I say somewhat, because the algorithm breaks out of the function when the desired target grid is found. Usually, Dijkstra's algorithm carries on until the entire 2-D grid is populated with distances.