Home > Term: breadth-first search
breadth-first search
Any search algorithm that considers neighbors of a vertex, that is, outgoing edges of the vertex's predecessor in the search, before any outgoing edges of the vertex. Extremes are searched last. This is typically implemented with a queue.
- Besedna vrsta: noun
- Industrija/področje: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Avtor
- GeorgeV
- 100% positive feedback