OnlineWoerterBuecher.de - Lexikon, Free On-line Dictionary of Computing



	OnlineWoerterBuecher.de

Navigation

Start

Deutsch-Englisch

Deutsch-Spanisch

Enzyklopädie

Internes

Impressum

Kontakt

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)

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">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

	All logos and trademarks in this site are property of their respective owner. Page Generation in 0.0832 Seconds, with 16 Database-Queries