Template:Graph search algorithm
From blackwiki
Revision as of 17:46, 1 December 2011 by
imported>Frietjes
(plainlist)
(
diff
)
← Older revision
|
Latest revision
(
diff
) |
Newer revision →
(
diff
)
Jump to navigation
Jump to search
Graph
and
tree
search algorithms
Alpha-beta pruning
A*
B*
Beam
Bellman–Ford algorithm
Best-first
Bidirectional
Breadth-first
D*
Depth-first
Depth-limited
Dijkstra's algorithm
Floyd–Warshall algorithm
Hill climbing
Iterative deepening depth-first
Johnson's algorithm
Lexicographic breadth-first
Uniform-cost
more
Related topics
Dynamic programming
Search games
v
t
e
ru:Шаблон:Алгоритмы поиска на графах
Categories
:
Computer science 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