Difference between revisions of "Template:Graph search algorithm"
Jump to navigation
Jump to search
imported>Diego Moya |
imported>Diego Moya (Expand template) |
||
| Line 29: | Line 29: | ||
* [[Prim's algorithm]] | * [[Prim's algorithm]] | ||
* [[Uniform-cost search|Uniform-cost]] | * [[Uniform-cost search|Uniform-cost]] | ||
| − | |||
| − | |heading2 = | + | |heading2 = Listings |
|content2 = | |content2 = | ||
| + | * ''[[:Category:Graph algorithms|Graph algorithms]]'' | ||
| + | * ''[[:Category:Search algorithms|Search algorithms]]'' | ||
| + | * ''[[List_of_algorithms#Graph_algorithms|List of graph algorithms]]'' | ||
| + | |||
| + | |heading3 = Related topics | ||
| + | |content3 = | ||
* [[Dynamic programming]] | * [[Dynamic programming]] | ||
| + | * [[Graph traversal]] | ||
| + | * [[Tree traversal]] | ||
* [[Search games]] | * [[Search games]] | ||
}}<noinclude> | }}<noinclude> | ||
Revision as of 09:46, 11 March 2012
fa:الگو:الگوریتم پیمایش درخت ru:Шаблон:Алгоритмы поиска на графах