Jump to content

User:Varkora/sandbox/Recursive best-first search

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Varkora (talk | contribs) at 17:26, 3 May 2016 (←Created page with '{{Userspace draft|source=ArticleWizard|date={{Subst:CURRENTMONTHNAME}} {{Subst:CURRENTYEAR}}}} {{Subst:Nul|<==do not change this line, it will set the date autom...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
ClassSearch algorithm
Data structureGraph
Worst-case space complexity

Template:Graph search algorithm 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

References

  1. ^ Artificial Intelligence: A Modern Approach. ISBN 0-13-604259-7.
Retrieved from "https://en.wikipedia.org/w/index.php?title=User:Varkora/sandbox/Recursive_best-first_search&oldid=718462845"