Difference between revisions of "Template:Graph search algorithm"

From blackwiki
Jump to navigation Jump to search
(Sidebar)
imported>Drmies
m (rvv)
 
(35 intermediate revisions by 21 users not shown)
Line 1: Line 1:
{{Sidebar
+
{{ sidebar
|name = Graph search algorithm
+
| name   = Graph search algorithm
|style = width:15.0em;
+
| title   = [[Graph traversal|Graph]] and [[Tree traversal|tree<br/>search algorithms]]
|title = [[Graph traversal|Graph]] and [[Tree traversal|tree<br/>search algorithms]]
+
| class  = hlist
|titlestyle = background:#ccf;
 
  
|content1 = <div>
+
|content1 =  
[[Alpha-beta pruning]]<br/>
+
* [[Alpha–beta pruning|α–β]]
[[A* search algorithm|A*]]<br/>
+
* [[A* search algorithm|A*]]
[[B*]]<br/>
+
* [[B*]]
[[Beam search|Beam]]<br/>
+
* [[Backtracking]]
[[Bellman–Ford algorithm]]<br/>
+
* [[Beam search|Beam]]
[[Best-first search|Best-first]]<br/>
+
* [[Bellman–Ford algorithm|Bellman–Ford]]
[[Bidirectional search|Bidirectional]]<br/>
+
* [[Best-first search|Best-first]]
[[Breadth-first search|Breadth-first]]<br/>
+
* [[Bidirectional search|Bidirectional]]
[[D*]]<br/>
+
* [[Borůvka's algorithm|Borůvka]]
[[Depth-first search|Depth-first]]<br/>
+
* [[Branch and bound|Branch & bound]]
[[Depth-limited search|Depth-limited]]<br/>
+
* [[Breadth-first search|BFS]]
[[Dijkstra's algorithm]]<br/>
+
* [[British Museum algorithm|British Museum]]
[[Floyd–Warshall algorithm]]<br/>
+
* [[D*]]
[[Hill climbing]]<br/>
+
* [[Depth-first search|DFS]]
[[Iterative deepening depth-first search|Iterative deepening depth-first]]
+
* [[Dijkstra's algorithm|Dijkstra]]
[[Johnson's algorithm]]<br/>
+
* [[Edmonds' algorithm|Edmonds]]
[[Lexicographic breadth-first search|Lexicographic breadth-first]]<br/>
+
* [[Floyd–Warshall algorithm|Floyd–Warshall]]
[[Uniform-cost search|Uniform-cost]]<br/>
+
* [[Fringe search]]
''[[:Category:Search algorithms|more]]''
+
* [[Hill climbing]]
</div>
+
* [[Iterative deepening A*|IDA*]]
 +
* [[Iterative deepening depth-first search|Iterative deepening]]
 +
* [[Johnson's algorithm|Johnson]]
 +
* [[Jump point search|Jump point]]
 +
* [[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 = [[Dynamic programming]]<br/>[[Search games]]
+
|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]]
 +
* [[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