Template:Graph search algorithm
From blackwiki
Revision as of 17:32, 1 December 2010 by
imported>Ixfd64
(shorten)
(
diff
)
← Older revision
|
Latest revision
(
diff
) |
Newer revision →
(
diff
)
Jump to navigation
Jump to search
Graph
and
tree search algorithms
Search
Alpha-beta pruning
A*
B*
Beam search
Bellman–Ford algorithm
Best-first search
Bidirectional search
Breadth-first search
D*
Depth-first search
Depth-limited search
Dijkstra's algorithm
Floyd–Warshall algorithm
Hill climbing
Iterative deepening depth-first search
Johnson's algorithm
Lexicographic breadth-first search
Uniform-cost search
More
Related
Dynamic programming
Search games
ru:Шаблон:Алгоритмы поиска на графах
Categories
:
Computing templates
Exclude in print
Navigation menu
Personal tools
English
Create account
Log in
Namespaces
Template
Discussion
Variants
Views
Read
View source
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information