Difference between revisions of "Template:Graph search algorithm"
Jump to navigation
Jump to search
imported>Diego Moya |
|||
| Line 20: | Line 20: | ||
* [[Depth-limited search|Depth-limited]] | * [[Depth-limited search|Depth-limited]] | ||
* [[Dijkstra's algorithm]] | * [[Dijkstra's algorithm]] | ||
| + | * [[Edmonds' algorithm]] | ||
* [[Floyd–Warshall algorithm]] | * [[Floyd–Warshall algorithm]] | ||
* [[Hill climbing]] | * [[Hill climbing]] | ||
| Line 26: | Line 27: | ||
* [[Johnson's algorithm]] | * [[Johnson's algorithm]] | ||
* [[Lexicographic breadth-first search|Lexicographic breadth-first]] | * [[Lexicographic breadth-first search|Lexicographic breadth-first]] | ||
| + | * [[Prim's algorithm]] | ||
* [[Uniform-cost search|Uniform-cost]] | * [[Uniform-cost search|Uniform-cost]] | ||
* ''[[:Category:Search algorithms|more]]'' | * ''[[:Category:Search algorithms|more]]'' | ||
Revision as of 09:38, 11 March 2012
fa:الگو:الگوریتم پیمایش درخت ru:Шаблон:Алгоритмы поиска на графах