{"id":22828773,"url":"https://github.com/costingh/pathfinding-algorithm-visualiser","last_synced_at":"2025-10-16T05:45:57.973Z","repository":{"id":196742583,"uuid":"345934084","full_name":"costingh/Pathfinding-Algorithm-Visualiser","owner":"costingh","description":"App designed to illustrate how popular pathfinding algorithms (like Dijkstra, DFS, BFS, A*) work. The algorithms are implemented using JavaScript.","archived":false,"fork":false,"pushed_at":"2021-06-19T18:34:47.000Z","size":1413,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-31T01:18:07.917Z","etag":null,"topics":["astar-algorithm","bfs","dfs-algorithm","dijkstra-algorithm","javascript","react"],"latest_commit_sha":null,"homepage":"https://costingh.github.io/deploy-pathfinding-visualiser/","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/costingh.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2021-03-09T08:25:24.000Z","updated_at":"2021-10-29T10:47:54.000Z","dependencies_parsed_at":null,"dependency_job_id":"539dff48-f271-4d50-9b37-7c04cd5ce188","html_url":"https://github.com/costingh/Pathfinding-Algorithm-Visualiser","commit_stats":null,"previous_names":["costingh/pathfinding-algorithm-visualiser"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/costingh/Pathfinding-Algorithm-Visualiser","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/costingh%2FPathfinding-Algorithm-Visualiser","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/costingh%2FPathfinding-Algorithm-Visualiser/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/costingh%2FPathfinding-Algorithm-Visualiser/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/costingh%2FPathfinding-Algorithm-Visualiser/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/costingh","download_url":"https://codeload.github.com/costingh/Pathfinding-Algorithm-Visualiser/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/costingh%2FPathfinding-Algorithm-Visualiser/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":265617456,"owners_count":23799052,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["astar-algorithm","bfs","dfs-algorithm","dijkstra-algorithm","javascript","react"],"created_at":"2024-12-12T19:12:10.630Z","updated_at":"2025-10-16T05:45:52.939Z","avatar_url":"https://github.com/costingh.png","language":"JavaScript","readme":"# Pathfinding Algorithm Visualiser\n\n## Click [here](https://costingh.github.io/deploy-pathfinding-visualiser/) for a live demo of this app!\n\n![Demo Image](https://github.com/costingh/Pathfinding-Algorithm-Visualiser/blob/master/demo-img.png?raw=true)\n\n### Description\n\nThis is a tool built using react, that allows visualising the path between two nodes, found with the help of a choosen algorithm.\n\n### Algorithms implemented\n\n## 1. Dijkstra\n\nDijkstra’s Algorithm lets us prioritize which paths to explore. Instead of exploring all possible paths equally, it favors lower cost paths.\nWe can assign lower cost to encourage moving on roads while assigning high cost on highway to avoid them.\nIt is the algorithm of choice for finding the shortest paths with multiple destinations.\n\n## 2. A*\n\nA* is a modification of Dijkstra’s Algorithm that is optimized for a single destination.\nDijkstra’s Algorithm can find paths to all locations; A* finds paths to one location. It prioritizes paths that seem to be leading closer to a goal.\nIn a game, we could set costs to be attracted or discouraged in going near some objects : how useful it is for an AI.\nIt is more or less the golden ticket or industry standard algorithm for all applications finding directions between two locations.\nIt can be performed using different type of heuristics (only manhattan, euclidian, diagonal are implemented).\n\n## 3. Bredth First Search\n\nBreadth First Search explores equally in all directions.\nThis is an incredibly useful algorithm, not only for regular traversal, but also for procedural map generation, flow field pathfinding, distance maps, and other types of map analysis.\nThis may be the algorithm of choice to identify nearby places of interest in GPS.\nBFS guarantees the shortest path.\n\n## 4. Depth First Search\n\nTraverses by exploring as far as possible down each path before backtracking.\nAs useful as the BFS: DFS can be used to generate a topological ordering, to generate mazes, to traverse trees, to build decision trees, to discover a solution path with hierarchical choices.\nDFS does not guarantee the shortest path.\n\n### Functionality\nAt first on the grid there are two nodes drawn (start and finish). You cand draw obstacles, such like walls, and then choose the algorithm that you want to visualise. After clicking visualise, the algorithm will compute the path from start to finish node, and then you will see the animation.\n\n### Tech Stack\n* HTML\n* CSS\n* React\n* Javascript\n# Getting Started with Create React App\n\nThis project was bootstrapped with [Create React App](https://github.com/facebook/create-react-app).\n\n## Available Scripts\n\nIn the project directory, you can run:\n\n### `yarn start`\n\nRuns the app in the development mode.\\\nOpen [http://localhost:3000](http://localhost:3000) to view it in the browser.\n\nThe page will reload if you make edits.\\\nYou will also see any lint errors in the console.\n\n### `yarn test`\n\nLaunches the test runner in the interactive watch mode.\\\nSee the section about [running tests](https://facebook.github.io/create-react-app/docs/running-tests) for more information.\n\n### `yarn build`\n\nBuilds the app for production to the `build` folder.\\\nIt correctly bundles React in production mode and optimizes the build for the best performance.\n\nThe build is minified and the filenames include the hashes.\\\nYour app is ready to be deployed!\n\nSee the section about [deployment](https://facebook.github.io/create-react-app/docs/deployment) for more information.\n\n### `yarn eject`\n\n**Note: this is a one-way operation. Once you `eject`, you can’t go back!**\n\nIf you aren’t satisfied with the build tool and configuration choices, you can `eject` at any time. This command will remove the single build dependency from your project.\n\nInstead, it will copy all the configuration files and the transitive dependencies (webpack, Babel, ESLint, etc) right into your project so you have full control over them. All of the commands except `eject` will still work, but they will point to the copied scripts so you can tweak them. At this point you’re on your own.\n\nYou don’t have to ever use `eject`. The curated feature set is suitable for small and middle deployments, and you shouldn’t feel obligated to use this feature. However we understand that this tool wouldn’t be useful if you couldn’t customize it when you are ready for it.\n\n## Learn More\n\nYou can learn more in the [Create React App documentation](https://facebook.github.io/create-react-app/docs/getting-started).\n\nTo learn React, check out the [React documentation](https://reactjs.org/).\n\n### Code Splitting\n\nThis section has moved here: [https://facebook.github.io/create-react-app/docs/code-splitting](https://facebook.github.io/create-react-app/docs/code-splitting)\n\n### Analyzing the Bundle Size\n\nThis section has moved here: [https://facebook.github.io/create-react-app/docs/analyzing-the-bundle-size](https://facebook.github.io/create-react-app/docs/analyzing-the-bundle-size)\n\n### Making a Progressive Web App\n\nThis section has moved here: [https://facebook.github.io/create-react-app/docs/making-a-progressive-web-app](https://facebook.github.io/create-react-app/docs/making-a-progressive-web-app)\n\n### Advanced Configuration\n\nThis section has moved here: [https://facebook.github.io/create-react-app/docs/advanced-configuration](https://facebook.github.io/create-react-app/docs/advanced-configuration)\n\n### Deployment\n\nThis section has moved here: [https://facebook.github.io/create-react-app/docs/deployment](https://facebook.github.io/create-react-app/docs/deployment)\n\n### `yarn build` fails to minify\n\nThis section has moved here: [https://facebook.github.io/create-r\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcostingh%2Fpathfinding-algorithm-visualiser","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcostingh%2Fpathfinding-algorithm-visualiser","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcostingh%2Fpathfinding-algorithm-visualiser/lists"}