WesOfX/astar
Efficient shortest-path algorithm implemented in C++
This algorithm helps developers find the most efficient route or connection between two points in a network or system. You provide a starting point, an end point, and the connections and their associated costs (like distance, time, or resources) within your system. It then outputs the lowest total cost of the optimal path. This is used by software engineers and technical practitioners building systems that require optimized pathfinding.
No commits in the last 6 months.
Use this if you are a developer integrating a shortest-path algorithm into a C++ application for graphs where edge weights are non-negative.
Not ideal if you need to find paths in graphs with negative edge weights or if your application is not written in C++.
Stars
7
Forks
—
Language
C++
License
MIT
Last pushed
Jan 23, 2017
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/WesOfX/astar"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
forestagostinelli/deepxube
Learn a domain-specific heuristic function in a domain-independent fashion to solve pathfinding problems.
misaghsoltani/DeepCubeAI
Learning Discrete World Models for Heuristic Search
FK04/AI_Lab
AI lab implementations covering informed and uninformed search algorithms with classic...
algoprog/Laby
Maze generator, editor & solver in Java
tekian/path-finder
Visualization tool to demonstrate how different search algorithms work.