Hakuluettelo:
Käännös:
breadth-first search (suomeksi)
- Määritelmät:
- (lb, en, graph theory) A search algorithm that begins at the root node and explores all the neighboring nodes.
Viimeisimmät haut: breadth-first search, clean shell, armrack, binary clones, cake server, back-annotates