{"id":19399143,"url":"https://github.com/alipc598/pathfinding","last_synced_at":"2026-04-18T01:01:27.404Z","repository":{"id":217725961,"uuid":"744667415","full_name":"Alipc598/Pathfinding","owner":"Alipc598","description":"A* in comparison with weaker alternative(Branch and bound) algorithms","archived":false,"fork":false,"pushed_at":"2024-01-18T01:37:33.000Z","size":238,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-10T23:44:44.916Z","etag":null,"topics":["astar-algorithm","branch-and-bound","pathfinding-algorithm","python"],"latest_commit_sha":null,"homepage":"","language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Alipc598.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.txt","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-01-17T19:09:07.000Z","updated_at":"2024-01-18T01:22:36.000Z","dependencies_parsed_at":null,"dependency_job_id":"2959cdaa-816c-49b7-a7df-c1fe3b803fa4","html_url":"https://github.com/Alipc598/Pathfinding","commit_stats":null,"previous_names":["alipc598/pathfinding"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Alipc598/Pathfinding","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Alipc598%2FPathfinding","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Alipc598%2FPathfinding/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Alipc598%2FPathfinding/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Alipc598%2FPathfinding/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Alipc598","download_url":"https://codeload.github.com/Alipc598/Pathfinding/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Alipc598%2FPathfinding/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31952206,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-18T00:39:45.007Z","status":"ssl_error","status_checked_at":"2026-04-18T00:39:20.671Z","response_time":62,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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","branch-and-bound","pathfinding-algorithm","python"],"created_at":"2024-11-10T11:08:17.108Z","updated_at":"2026-04-18T01:01:27.394Z","avatar_url":"https://github.com/Alipc598.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Pathfinding Algorithms Comparison\n\n## Overview\nThis project provides a detailed comparison between two well-known pathfinding algorithms: A* and Branch and Bound. The comparison is based on various metrics such as nodes explored, execution time, and path efficiency across different scenarios.\n\n## Features\n- Implementation of the A* algorithm with heuristic function\n- Implementation of the Branch and Bound algorithm\n- Comparative analysis based on node exploration and execution time\n- Visualizations of the algorithms' paths on grid-based maps\n\n## Interactive Notebooks\nThe repository contains Jupyter notebooks that can be interactively explored to understand the behavior and performance of the algorithms. The notebooks include:\n- `pathfinding_algorithm_comparison.ipynb`: A detailed comparison of the algorithms with visualizations and analysis.\n\n## Usage\nTo interact with the notebooks, you can use services like [Binder](https://mybinder.org/) to launch a live environment or view them statically via [nbviewer](https://nbviewer.jupyter.org/).\n\n## Results\nThe findings indicate that the A* algorithm generally outperforms the Branch and Bound in terms of efficiency and execution time, especially as the complexity of the pathfinding scenario increases.\n\n## Visualization\nThe visualizations within the notebooks provide an intuitive understanding of the algorithms' search patterns and paths discovered.\n\n## Contributing\nContributions to the project are welcome. Please fork the repository and submit a pull request with your suggested changes.\n\n## License\nThis project is open-sourced under the MIT License. See the LICENSE file for more information.\n\n## Contact\nFor any queries or further discussion related to this project, please open an issue on this repository.\n\n## Acknowledgments\n- The A* and Branch and Bound algorithms are well-documented in the field of computer science, and their comparative analysis provides valuable insights into pathfinding in various applications.\n- Thanks to the community contributors and to all the researchers whose work has laid the foundation for these algorithms.\n\n## Reference\nThis project is based on the comprehensive insights and methodologies presented in the paper \"A Systematic Literature Review of A Pathfinding.\" This paper forms the foundation upon which the comparative analysis of the A* and Branch and Bound algorithms is built.\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Falipc598%2Fpathfinding","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Falipc598%2Fpathfinding","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Falipc598%2Fpathfinding/lists"}