https://github.com/hind-sagar-biswas/pathfindr

A visualizer of path finder (BFS) algorithm and maze generator (DFS)
https://github.com/hind-sagar-biswas/pathfindr

algorithm algorithm-visualizer bfs-search dfs-algorithm graph grid javascript pathfinder

Last synced: 4 days ago
JSON representation

A visualizer of path finder (BFS) algorithm and maze generator (DFS)

• Host: GitHub
• URL: https://github.com/hind-sagar-biswas/pathfindr
• Owner: hind-sagar-biswas
• License: mit
• Created: 2023-02-16T20:18:55.000Z (almost 2 years ago)
• Default Branch: main
• Last Pushed: 2024-01-28T12:01:21.000Z (about 1 year ago)
• Last Synced: 2024-12-08T12:13:43.380Z (2 months ago)
• Topics: algorithm, algorithm-visualizer, bfs-search, dfs-algorithm, graph, grid, javascript, pathfinder
• Language: JavaScript
• Homepage: https://hind-sagar-biswas.github.io/pathfindr
• Size: 568 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# pathfindr v1.3

A visualizer of path finder algorithm. Generate a grid, set blockades, choose start and end points and the algo will find you the shortest route to your Destinatin....

## IMPORTANT NOTES

- Make sure to keep at least one path open [else RIP your RAM!]

- The bigger the grid you make, the more time it will take [Highest recommendation: 30x30]

- There might be some BUGS

If any bugs found, create an issue or report at 

**PATH FINDR:** implementation of _BFS algorithm_

**MAZE GENERATOR:** implementation of _DFS algorithm_

## NEXT TARGETS

- Create maze runner game [**DIR:** mazeRunr]

  - Generate a maze [DONE]

  - Find the longest open route to set up start and target points.

    - Modify _BFS algorithm_ to run through all open nodes to find the longest route.

  - Put a player avatar on start point and make it able to go through open nodes.

- Develop **A\* algorithm**