depth-first search
Look at other dictionaries:
Depth-first search — Order in which the nodes are visited Class Search algorithm Data structure Graph Worst case performance … Wikipedia
Depth-First Search — Tiefensuche Tiefensuche (Depth First Search) ist in der Informatik ein Verfahren zum Suchen eines Knotens in einem Graphen. Sie zählt zu den uninformierten Suchalgorithmen. Eine Verbesserung der Tiefensuche ist die iterative Tiefensuche.… … Deutsch Wikipedia
Depth-first search — Algorithme de parcours en profondeur L algorithme de parcours en profondeur (ou DFS, pour Depth First Search) est le principe qui s abstrait de ce qu on connait comme la façon simple de parcourir un labyrinthe sans tourner en rond. La pédagogie… … Wikipédia en Français
depth-first-search — paieška į gylį statusas T sritis informatika apibrėžtis ↑Paieškos medžio apėjimo būdas, kai pirma analizuojamas tam tikro mazgo ↑pomedis, o tada – neanalizuoti to paties lygio mazgai. atitikmenys: angl. depth first search ryšiai: dar žiūrėk –… … Enciklopedinis kompiuterijos žodynas
Iterative deepening depth-first search — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
Depth-limited search — Class Search Algorithm Data structure Graph Worst case performance O( | V | + | E | ) … Wikipedia
Breadth-first search — Infobox Algorithm class=Search Algorithm Order in which the nodes are expanded data=Graph time=O(|V|+|E|) = O(b^d) space=O(|V|+|E|) = O(b^d) optimal=yes (for unweighted graphs) complete=yesIn graph theory, breadth first search (BFS) is a graph… … Wikipedia
Search algorithm — In computer science, a search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions. Most of the algorithms studied by computer… … Wikipedia
A* search algorithm — In computer science, A* (pronounced A star ) is a best first, graph search algorithm that finds the least cost path from a given initial node to one goal node (out of one or more possible goals). It uses a distance plus cost heuristic function… … Wikipedia
Search for HMAS Sydney and German auxiliary cruiser Kormoran — A search for the wrecks of the Australian warship HMAS Sydney and the German merchant raider Kormoran , that sank each other during World War II, ended successfully in March 2008. On 19 November 1941, the two ships fought a battle in the Indian… … Wikipedia
