Discovery
Relationship Discovery
Explore how algorithms connect through alternatives, variants, dependencies, prerequisites, and conceptual neighbors.
Changelog note: Curated relationship count was reduced from 4,839 to 1,829 after removing auto-generated templated links.
1829
Typed relationships
999
Algorithms with links
13
Relationship types
0
Needs review
1000 of 1000 algorithms
Algorithms
Showing first 48. Narrow the search for more precision.
Selected Algorithm
Pathfinding
A* Search
Finds a low-cost path by combining path cost so far with a heuristic estimate to the goal.
Interactive 2D Ego-Graph · Click Any Neighbor to Recenter
Showing 12 direct typed relationships around A* Search
D* Lite extends A*-style planning to changing graphs.
Good next jumps
6 suggestionsHas variants 11
Algorithms that are listed as variants of this method.
D* Lite is an incremental replanning variant related to A*.
LPA* incrementally repairs A*-style shortest-path estimates.
Anytime Repairing A* refines a feasible path over time.
Lazy Theta* is a pathfinding variant of A* Search with a different search or heuristic tradeoff.
Block A* is a pathfinding variant of A* Search with a different search or heuristic tradeoff.
Showing 8 of 11.
Alternatives 4
Algorithms that solve a similar problem and can be compared by tradeoff.
Greedy best-first search prioritizes heuristic distance without full path-cost balancing.
RRT explores continuous spaces where grid-based A* may be impractical.
Weighted A* is a route-search alternative to A* Search with different heuristic or replanning behavior.
Alternatives 1
Algorithms that solve a similar problem and can be compared by tradeoff.
A* balances path cost and heuristic cost, while greedy best-first focuses on the heuristic.
Used by 1
Algorithms that rely on this method, structure, or idea.
Hierarchical pathfinding often searches abstract regions before refining paths with A*-style search.
Uses 1
Algorithms this method relies on through inverse used-by links.
Uses 1
Methods, data structures, or subroutines this algorithm relies on.
Prerequisites 1
Algorithms that are listed as prerequisites for this method.
A* adds a heuristic estimate to Dijkstra-style path search.
Improved by 2
Algorithms that improve on this method.
Generalizes 1
Broader methods that cover this algorithm's mechanism or problem shape.
Improves on 1
Methods that this algorithm refines, speeds up, or makes more practical.
Conceptual neighbors 1
Algorithms that share a mechanism, family, or design idea.
Dynamic Window Approach and A* Search both relate to local robot navigation, but use different structures or assumptions.