Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

iterative deepening depth-first search · Vinony

🌐English

English Deutsch Español Italiano Nederlands فارسی ไทย 한국어 中文日本語

EntityQ1675274· pop 14· linked from 56 articles

iterative deepening depth-first search

search strategy

Connections

A* search algorithm

Bellman–Ford algorithm

Categories

Graph algorithms Search algorithms

Sources

wikipedia.externallinksexternallink

chess

Entity

computer science

International Standard Book Number

digital object identifier

Dijkstra's algorithm

depth-first search

breadth-first search

geometric series

search algorithm

Prim's algorithm

minimum spanning tree

Kruskal's algorithm

time complexity

Sign in to save

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

depth-limited search

Entitydist 0.24

Entitydist 0.58

Entitydist 0.60

Entitydist 0.62

Pisces-class deep submergence vehicle

Entitydist 0.64

DSV Shinkai 6500

Entitydist 0.66

convolutional neural network

Entitydist 0.67

Entitydist 0.67

Hubble eXtreme Deep Field

Entitydist 0.68

Hubble Ultra-Deep Field

Entitydist 0.69

Entitydist 0.69

stereoscopic rangefinder

Entitydist 0.70

What links here56 pages

Monte Carlo tree search

depth-first search

Dijkstra's algorithm

Johnson's algorithm

bidirectional search

breadth-first search

Simplified Memory-Bounded A*

method of analytic tableaux

graph traversal

Bellman–Ford algorithm

jump point search

Edmonds' algorithm

Borůvka's algorithm

iterative deepening A*

A* search algorithm