Difference between revisions of "Template:Graph search algorithm"

From blackwiki
Jump to navigation Jump to search
imported>Frietjes
m (plainlist)
imported>Drmies
m (rvv)
 
(34 intermediate revisions by 21 users not shown)
Line 1: Line 1:
{{Sidebar
+
{{ sidebar
|name = Graph search algorithm
+
| name   = Graph search algorithm
|style = width:15em;
+
| title   = [[Graph traversal|Graph]] and [[Tree traversal|tree<br/>search algorithms]]
|title = [[Graph traversal|Graph]] and [[Tree traversal|tree<br/>search algorithms]]
+
| class  = hlist
|titleclass = navbox-title
 
|bodyclass = plainlist
 
  
 
|content1 =  
 
|content1 =  
* [[Alpha-beta pruning]]
+
* [[Alpha–beta pruning|α–β]]
 
* [[A* search algorithm|A*]]
 
* [[A* search algorithm|A*]]
 
* [[B*]]
 
* [[B*]]
 +
* [[Backtracking]]
 
* [[Beam search|Beam]]
 
* [[Beam search|Beam]]
* [[Bellman–Ford algorithm]]
+
* [[Bellman–Ford algorithm|Bellman–Ford]]
 
* [[Best-first search|Best-first]]
 
* [[Best-first search|Best-first]]
 
* [[Bidirectional search|Bidirectional]]
 
* [[Bidirectional search|Bidirectional]]
* [[Breadth-first search|Breadth-first]]
+
* [[Borůvka's algorithm|Borůvka]]
 +
* [[Branch and bound|Branch & bound]]
 +
* [[Breadth-first search|BFS]]
 +
* [[British Museum algorithm|British Museum]]
 
* [[D*]]
 
* [[D*]]
* [[Depth-first search|Depth-first]]
+
* [[Depth-first search|DFS]]
* [[Depth-limited search|Depth-limited]]
+
* [[Dijkstra's algorithm|Dijkstra]]
* [[Dijkstra's algorithm]]
+
* [[Edmonds' algorithm|Edmonds]]
* [[Floyd–Warshall algorithm]]
+
* [[Floyd–Warshall algorithm|Floyd–Warshall]]
 +
* [[Fringe search]]
 
* [[Hill climbing]]
 
* [[Hill climbing]]
* [[Iterative deepening depth-first search|Iterative deepening depth-first]]
+
* [[Iterative deepening A*|IDA*]]
* [[Johnson's algorithm]]
+
* [[Iterative deepening depth-first search|Iterative deepening]]
* [[Lexicographic breadth-first search|Lexicographic breadth-first]]
+
* [[Johnson's algorithm|Johnson]]
* [[Uniform-cost search|Uniform-cost]]
+
* [[Jump point search|Jump point]]
* ''[[:Category:Search algorithms|more]]''
+
* [[Kruskal's algorithm|Kruskal]]
 +
* [[Lexicographic breadth-first search|Lexicographic BFS]]
 +
* [[Lifelong Planning A*|LPA*]]
 +
* [[Prim's algorithm|Prim]]
 +
* [[SMA*]]
  
|heading2 = Related topics
+
|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]]
* [[Search games]]
+
* [[Graph traversal]]
 +
* [[Tree traversal]]
 +
* [[Search game]]s
 
}}<noinclude>
 
}}<noinclude>
 
+
[[Category:Computer science sidebar templates‎]]
[[Category:Computer science templates|{{PAGENAME}}]]
 
[[Category:Exclude in print]]
 
 
 
[[ru:Шаблон:Алгоритмы поиска на графах]]
 
 
</noinclude>
 
</noinclude>

Latest revision as of 01:19, 23 October 2020