Home Articles FAQs XREF Games Software Instant Books BBS About FOLDOC RFCs Feedback Sitemap

breadth-first search

You are here: irt.org | FOLDOC | breadth-first search

<algorithm> A graph search algorithm which tries all one-step extensions of current paths before trying larger extensions. This requires all current paths to be kept in memory simultaneously, or at least their end points.

Opposite of depth-first search. See also best first search.


Nearby terms: Brazil « BRB « breadcrumbs « breadth-first search » break » break-even point » breakpoint

FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL

©2018 Martin Webb