Jump to content

User:Varkora/sandbox/Recursive best-first search

From Wikipedia, the free encyclopedia
ClassSearch algorithm
Data structureGraph
Worst-case space complexity

Recursive best-first search is a graph traversal and path search algorithm that can find the shortest path between a designated start node and any member of a set of goal nodes in a weighted graph.[1]

Pseudocode

[edit]

References

[edit]
  1. ^ Artificial Intelligence: A Modern Approach. ISBN 0-13-604259-7.


Category:Graph algorithms Category:Routing algorithms Category:Search algorithms Category:Game artificial intelligence