Difference between revisions of "Template:Graph search algorithm"
Jump to navigation
Jump to search
| Line 14: | Line 14: | ||
* [[Best-first search|Best-first]] | * [[Best-first search|Best-first]] | ||
* [[Bidirectional search|Bidirectional]] | * [[Bidirectional search|Bidirectional]] | ||
| + | * [[Borůvka's algorithm]] | ||
* [[Breadth-first search|Breadth-first]] | * [[Breadth-first search|Breadth-first]] | ||
* [[D*]] | * [[D*]] | ||
Revision as of 16:50, 30 December 2011
fa:الگو:الگوریتم پیمایش درخت ru:Шаблон:Алгоритмы поиска на графах