Übersetzung für 'breadth first search' von Englisch nach Deutsch

breadth first search

Breitensuche {f}comp.

breadth-first search <BFS>

Breitensuche {f}comp.math.

---

Werbung

depth-first search <DFS>

Tiefensuche {f}comp.math.

breadth

Breite {f}

Bedeutung {f} [Bandbreite]

Quere {f} [ugs.] [meist nur in Wendungen]

Weite {f}

Größe {f}

thorax breadth

Brustbreite {f}anat.

subject breadth

Fächerbreite {f}educ.

overall breadth

Gesamtbreite {f}

chest breadth

Brustbreite {f}anat.cloth.

habitat breadth

Habitatbreite {f}ecol.

niche breadth

Nischenbreite {f}ecol.

hand's breadth

Handbreit {f}

breadth of market

Marktbreite {f}

hair's breadth

Haar breit {n} [Rsv.]

Haarbreit {n}

Haaresbreite {f}

breadth [wide range]

Umfang {m} [fig.]

half-breadth plan

Wasserlinienriss {m}

breadth of mind

Auffassungs­gabe {f}

• This data abstraction mechanism makes the breadth-first search truly agnostic to the queue's implementation.
• Breadth-first search (BFS) is an algorithm for searching a tree data structure for a node that satisfies a given property.
• Breadth-first search can be viewed as a special-case of Dijkstra's algorithm on unweighted graphs, where the priority queue degenerates into a FIFO queue.
• In "breadth-first search" (BFS) or "level-order search", the search tree is broadened as much as possible before going to the next depth.
• Another usage of queues is in the implementation of breadth-first search.

• showed how to solve the problem more simply using lexicographic breadth-first search, based on the fact that a graph is an interval graph if and only if it is chordal and its complement is a comparability graph.
• Contrasting with depth-first order is breadth-first order, which always attempts to visit the node closest to the root that it has not already visited.
• The time complexity of IDDFS in a (well-balanced) tree works out to be the same as breadth-first search, i.e. [...] , [...] where [...] is the branching factor and [...] is the depth of the goal.