OnlineWoerterBuecher.de
Internes

Lexikon


breadth first search


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}. (1996-01-05)

In addition suitable contents:
[ = ] [ al ] [ algorithm ] [ am ] [ an ] [ ar ] [ arc ] [ arg ] [ as ] [ at ] [ b ] [ be ] [ best first search ] [ ch ] [ cu ] [ current ] [ de ] [ depth-first search ] [ du ] [ ee ] [ er ] [ es ] [ extension ] [ fi ] [ file ] [ fo ] [ for ] [ ge ] [ gr ] [ graph ] [ h ] [ hm ] [ hr ] [ hs ] [ id ] [ ie ] [ il ] [ in ] [ int ] [ io ] [ ir ] [ is ] [ it ] [ ke ] [ la ] [ Lex ] [ ls ] [ lt ] [ ly ] [ memory ] [ mo ] [ mod ] [ module ] [ mu ] [ na ] [ ne ] [ ng ] [ ns ] [ O ] [ pa ] [ path ] [ ph ] [ point ] [ pt ] [ query ] [ rc ] [ re ] [ S ] [ se ] [ si ] [ sit ] [ sl ] [ so ] [ st ] [ T ] [ th ] [ to ] [ tr ] [ us ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3104 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.0896 Seconds, with 17 Database-Queries
Zurück zur Startseite