How to pronounce “breadth-first search”

Meaning

• [Noun]
• (graph theory) A search algorithm that begins at the root node and explores all the neighboring nodes.

Practice Nearby Words

breadth, iterative deepening search, arborescence, binary search, generalized search tree, borůvka's algorithm, rootfinder, bellman-ford algorithm, small-world network, british museum algorithm, kruskal's algorithm, tabu search, root, branchwidth, rootfinding, rooted tree, tarjan's algorithm, alpha-beta pruning, greedy algorithm, topological sort, canadian traveller problem, cutwidth, arboricity, spanning tree, johnson's algorithm, expander, bisection method, neighborhood, avl tree, trail, steiner tree, suurballe's algorithm, cycle, superpath, chinese postman problem, sparsifier, walktrap, source, treewidth, null path length, path length, king, betweenness, primitive recursion, hypernode, algorithm x, forest, reachability, dipath, tree, stern-brocot tree, branch-decomposition, caterpillar tree, pseudoforest, centroid, ultrasparsifier, cherry, pathlength, nonblocker, link/cut tree, bridge, pseudoroot, closeness, multitree, k-d tree, minimum spanning tree, hillclimbing, bicombing, minimum cut, subtree, bradford’s law, kernighan-lin algorithm, subforest, supergraph, eulerian trail, anarboricity, de bruijn graph, splicer, extensive form game, b+ tree, groundset, recursive descent, eppstein's algorithm, binary indexed tree, de bruijn-erdős theorem, subnet, loose edge, sink, basinhopping, snark, equipartition, boron tree, subpath, snake-in-the-box problem, tutte matrix, edge cover, order statistic tree, branch cut, greedy property, small-worldness

Similar Sounds

breadfruit tree, breadfruit, brother sister, bedfordshire, bedford, barrister, barristers, beetroots, barrator, bed rest