Difference between revisions of "Template:Graph search algorithm"
Jump to navigation
Jump to search
imported>Ixfd64 (shorten) |
imported>Drmies m (rvv) |
||
| (37 intermediate revisions by 23 users not shown) | |||
| Line 1: | Line 1: | ||
| − | {| | + | {{ sidebar |
| − | + | | name = Graph search algorithm | |
| − | | | + | | title = [[Graph traversal|Graph]] and [[Tree traversal|tree<br/>search algorithms]] |
| − | | | + | | class = hlist |
| − | *[[ | + | |
| − | *[[A* search algorithm|A*]] | + | |content1 = |
| − | *[[B*]] | + | * [[Alpha–beta pruning|α–β]] |
| − | *[[Beam search]] | + | * [[A* search algorithm|A*]] |
| − | *[[Bellman–Ford algorithm]] | + | * [[B*]] |
| − | *[[Best-first search]] | + | * [[Backtracking]] |
| − | *[[Bidirectional search]] | + | * [[Beam search|Beam]] |
| − | *[[Breadth-first search]] | + | * [[Bellman–Ford algorithm|Bellman–Ford]] |
| − | *[[D*]] | + | * [[Best-first search|Best-first]] |
| − | *[[Depth-first search]] | + | * [[Bidirectional search|Bidirectional]] |
| − | *[[ | + | * [[Borůvka's algorithm|Borůvka]] |
| − | *[[ | + | * [[Branch and bound|Branch & bound]] |
| − | *[[Floyd–Warshall algorithm]] | + | * [[Breadth-first search|BFS]] |
| − | *[[Hill climbing]] | + | * [[British Museum algorithm|British Museum]] |
| − | *[[Iterative deepening depth-first search]] | + | * [[D*]] |
| − | *[[Johnson's algorithm]] | + | * [[Depth-first search|DFS]] |
| − | *[[Lexicographic breadth-first search]] | + | * [[Dijkstra's algorithm|Dijkstra]] |
| − | *[[ | + | * [[Edmonds' algorithm|Edmonds]] |
| − | | | + | * [[Floyd–Warshall algorithm|Floyd–Warshall]] |
| − | | | + | * [[Fringe search]] |
| − | + | * [[Hill climbing]] | |
| − | |''' | + | * [[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 = Listings | ||
| + | |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 game]]s | |
| − | [[ | + | }}<noinclude> |
| − | [[ | + | [[Category:Computer science sidebar templates]] |
| − | [[ | ||
</noinclude> | </noinclude> | ||
Latest revision as of 01:19, 23 October 2020
| Graph and tree search algorithms |
|---|
| Listings |
| Related topics |