In the Vinony graph
Within Vinony's link graph, iterative deepening A* is referenced by 39 other articles, and connects out to Bellman–Ford algorithm, International Standard Book Number and Rubik's Cube.
It is catalogued under topics including Game artificial intelligence, Graph algorithms and Routing algorithms.
Its subject is documented across 6 Wikipedia language editions.
Wikidata facts
- Subclass of
- A* search algorithm
- Named after
- A* search algorithm
Show 2 more facts
- uses
- tree
- computes solution to
- shortest path problem
Sources (2)
via Wikidata · CC0
Connections
Bellman–Ford algorithm
Entity
International Standard Book Number
Entity
Rubik's Cube
Entity
digital object identifier
Entity
arXiv
Entity
heuristic
Entity
Dijkstra's algorithm
Entity
tree
Entity
dynamic programming
Entity
depth-first search
Entity
breadth-first search
Entity
Semantic Scholar
Entity
search algorithm
Entity
Prim's algorithm
Entity
minimum spanning tree
Entity
A* search algorithm
Entity
Kruskal's algorithm
Entity
time complexity
Entity
graph data structure
Entity
Handle System
Entity