• PathFinder
  • Algorithms
    • BFS
    • DFS
    • Dijkstra
    • Bellman-Ford
  • Mazes
    • Recursive Division
  • Speed:x1
  • Clear
© Tayeb HAKKAR | Last updated 01/09/2024

# Legend

  • Wall (0...N) Tips : These are the points that the algorithm will not be able to go through
  • Start point (1) Tips : This is the point from which the algorithm will start
  • End point (0...N) Tips : This is the point where the algorithm will have to go to finish the path
  • Checkpoint (0...N) Tips : These are the points that the algorithm will have to go through
  • Visited (0..N) Tips : These are the points that the algorithm has already visited
  • Path (0...N) Tips : These are the points that the algorithm has taken to reach the end point