rdfs: label
ar
az
bg
ca
cs
de
el
en
eo
es
et
eu
fa
fi
fr
he
hi
hu
hy
it
ja
ko
lt
lv
mk
nb
nl
pl
pt
ro
ru
sl
sr
sv
th
tl
tr
uk
vi
yue
zh
zh-cn
zh-hans
zh-hant
zh-hk
zh-sg
zh-tw
"BFS"@mk
"Breitensuche"@de
"Cerca en amplada"@ca
"Eninə axtarış alqoritmi"@az
"Laiuti otsing"@et
"Meklēšana plašumā"@lv
"Paghahanap na luwang-muna"@tl
"Tìm kiếm theo chiều rộng"@vi
"Zabalera bilaketa"@eu
"algorithme de parcours en largeur"@fr
"breadth-first search"@en
"breadth-first search"@nl
"bredd-först-sökning"@sv
"bredde-først-søk"@nb
"busca em largura"@pt
"búsqueda en anchura"@es
"căutare în lățime"@ro
"iskanje v širino"@sl
"larĝema serĉo"@eo
"leveyssuuntainen läpikäynti"@fi
"paieška į plotį"@lt
"prohledávání do šířky"@cs
"przeszukiwanie wszerz"@pl
"ricerca in ampiezza"@it
"szélességi keresés"@hu
"sığ öncelikli arama"@tr
"Αναζήτηση κατά πλάτος"@el
"Обхождане в ширина"@bg
"Претрага у ширину"@sr
"поиск в ширину"@ru
"пошук у ширину"@uk
"Փնտրում դեպի լայնություն"@hy
"אלגוריתם חיפוש לרוחב"@he
"البحث المتسع الاول"@ar
"الگوریتم جستجوی اول سطح"@fa
"विस्तार-प्रधान खोज"@hi
"การค้นหาในแนวกว้าง"@th
"幅優先探索"@ja
"幅度優先搜尋"@yue
"广度优先搜索"@zh
"广度优先搜索"@zh-cn
"广度优先搜索"@zh-hans
"广度优先搜索"@zh-sg
"廣度優先搜索"@zh-hant
"廣度優先搜索"@zh-hk
"廣度優先搜索"@zh-tw
"너비 우선 탐색"@ko
skos: altLabel
ca
cs
de
en
eo
es
et
fa
fi
fr
he
hu
it
ko
lv
nl
pt
ro
ru
sv
tl
uk
zh
"BFS"@it
"BFS"@en
"BFS"@ca
"BFS"@he
"BFS"@pt
"BFS"@ro
"BFS"@sv
"BFS"@zh
"Breadth First Search"@ca
"Breadth First Search"@ro
"Breadth-first search"@cs
"Breadth-first search"@lv
"Breadth-first search"@tl
"Breitendurchlauf"@de
"Laiutiotsing"@et
"breadth first search"@en
"breadth-first search"@it
"breedte-eerst zoeken"@nl
"busqueda en anchura"@es
"larĝema trairo"@eo
"larĝiĝema trairo"@eo
"leveyshaku"@fi
"lrgeur d'abord"@fr
"parcours en largeur"@fr
"parcurgere în lățime"@ro
"percurso em largura"@pt
"primero en anchura"@es
"procházení do šířky"@cs
"szélességi bejárás"@hu
"visita in ampiezza"@it
"обход в ширину"@ru
"обход графа в ширину"@ru
"пошук в ширину"@uk
"חיפוש לרוחב"@he
"الگوریتم جستجوی یکم سطح"@fa
"بیافاس"@fa
"جستجوی سطح اول"@fa
"جستجوی سطح یکم"@fa
"宽度优先搜索"@zh
"广度优先搜索法"@zh
"넓이 우선 탐색"@ko
schema: description
ca
cs
de
en
es
fa
fr
it
ru
sl
uk
zh
"Suchalgorithmus in der Informatik (Graphentheorie)"@de
"algorisme per cercar els nodes d'un graf"@ca
"algoritem za iskanje vozlišč grafa po vrstnem redu glede na število skokov od začetnega vozlišča"@sl
"algorithm for searching the nodes of a graph in order by their hop count from a starting node"@en
"algorithme que permet le parcours d'un graphe ou d'un arbre"@fr
"algoritmo de búsqueda no informada utilizado para recorrer o buscar elementos en un grafo (usado frecuentemente sobre árboles)"@es
"algoritmo di ricerca per grafi che partendo da un vertice sorgente permette di cercare il cammino fino ad un altro nodo scelto e connesso al nodo sorgente"@it
"datový algoritmus"@cs
"метод обхода графа и поиска пути в графе"@ru
"неінформований алгоритм пошуку, котрий використовується для обходу або пошуку елементів у графі (часто використовується на деревах)"@uk
"الگوریتم جستجوی گرههای یک گراف"@fa
"图形搜索算法"@zh
schema: dateModified
"2026-08-11T14:13:28+00:00"^^xsd:dateTime
schema: version
2530029661
wikibase: identifiers
13
wikibase: sitelinks
41
wikibase: statements
27
p: P10
wd: statement/Q325904-a65dcbdc-43ef-8b32-e7f9-36db5d0f649e
p: P10283
wd: statement/Q325904-9D38629F-4020-40E8-BC69-2567444AA4AD
p: P10565
wd: statement/Q325904-2C7D5877-8D04-48B4-8DAA-394F981A75AC
p: P13397
wd: statement/Q325904-7334CEB3-837E-4D09-8376-1A915DA0B904
p: P14541
wd: statement/Q325904-C49EC025-1814-4678-A3A8-1D619EF31426
p: P1482
wd: statement/Q325904-283148D4-AD4E-4A80-8D6A-6FB43BC78850
p: P18
wd: statement/Q325904-03F560B7-B47C-41C9-BB57-1A4063F8BAF5
p: P1813
wd: statement/Q325904-d6d5dec3-475b-6ff9-d86c-0dbe13da42f4
p: P2283
wd: statement/Q325904-2b3ec0ed-46ca-0bbb-57ea-7a6a37b36cb5
wd: statement/Q325904-E61A9156-338C-4821-9993-0A27CFC6E819
p: P279
wd: statement/Q325904-272D65C5-4F44-40DC-BB8C-05C7F3E75C6E
p: P31
wd: statement/Q325904-32FFDB87-509B-4DDB-84B6-29C5F8965E6E
p: P3417
wd: statement/Q325904-9C807FC7-8168-4FC6-9193-544109A59371
p: P373
wd: statement/q325904-6DDFD05A-CFA5-481F-BF6F-77EF02D81C40
p: P3752
wd: statement/Q325904-8a22a6c0-4d18-85f0-011a-d0ebb2b4aec9
p: P3755
wd: statement/Q325904-5d60ff92-4244-78c9-65a8-6a41af520890
p: P5106
wd: statement/Q325904-B6DDAB54-063A-4C4C-9528-8C0DD5E42291
wd: statement/Q325904-FF49798D-C425-4F50-B8A7-838A59F47F12
p: P575
wd: statement/Q325904-cf1d18c8-4716-c68c-1a70-bd60a708496b
p: P61
wd: statement/Q325904-1fa75c44-4a2c-4d90-3bad-ca1b6756a042
p: P6366
wd: statement/Q325904-C238C484-154C-4CA6-8CD0-830730E1AE58
p: P646
wd: statement/Q325904-7774E078-6171-4052-9C2C-CD4C0933C82A
p: P6564
wd: statement/Q325904-1ef0191a-4879-85bf-d66c-4db5470a0a7d
p: P6706
wd: statement/Q325904-1a86c53d-4296-d922-9092-c02db82a1a9e
p: P7502
wd: statement/Q325904-A006E7CB-3EDE-4AB4-8B77-BDF27C6AB9D2
p: P9100
wd: statement/Q325904-05FB25DC-A77A-4817-936E-4A674A2547BE
p: P973
wd: statement/Q325904-6c6c6b89-42a9-a5ca-e6b0-35812f90bf1e
p: direct-normalized/P6366
<https://makg.org/entity/138843760>
wdt: P10
<http://commons.wikimedia.org/wiki/Special:FilePath/Breadth-First-Search-Algorithm.gif>
wdt: P10283
"C138843760"
wdt: P10565
"509027"
wdt: P13397
"breadth-first-search"
wdt: P14541
"2HFdi6"
wdt: P1482
<https://stackoverflow.com/tags/breadth-first-search>
wdt: P18
<http://commons.wikimedia.org/wiki/Special:FilePath/Breadth-first-tree.svg>
wdt: P1813
"BFS"@en
wdt: P2283
graph data structure
FIFO
wdt: P279
graph traversal
wdt: P31
uninformed search algorithm
wdt: P3417
"Breadth-first-Search-1"
wdt: P373
"Breadth-first search"
wdt: P3752
"<math class="mwe-math-element mwe-math-element-inline" xmlns="http://www.w3.org/1998/Math/MathML"><mrow data-mjx-texclass="ORD"><mstyle displaystyle="true" scriptlevel="0"><mi>O</mi><mo stretchy="false">(</mo><mo stretchy="false">|</mo><mi>V</mi><mo stretchy="false">|</mo><mo stretchy="false">+</mo><mo stretchy="false">|</mo><mi>E</mi><mo stretchy="false">|</mo><mo stretchy="false">)</mo><mo stretchy="false">=</mo><mi>O</mi><mo stretchy="false">(</mo><msup><mi>b</mi><mrow data-mjx-texclass="ORD"><mi>d</mi></mrow></msup><mo stretchy="false">)</mo></mstyle></mrow></math>"^^http://www.w3.org/1998/Math/MathML
wdt: P3755
"<math class="mwe-math-element mwe-math-element-inline" xmlns="http://www.w3.org/1998/Math/MathML"><mrow data-mjx-texclass="ORD"><mstyle displaystyle="true" scriptlevel="0"><mi>O</mi><mo stretchy="false">(</mo><mo stretchy="false">|</mo><mi>V</mi><mo stretchy="false">|</mo><mo stretchy="false">)</mo><mo stretchy="false">=</mo><mi>O</mi><mo stretchy="false">(</mo><msup><mi>b</mi><mrow data-mjx-texclass="ORD"><mi>d</mi></mrow></msup><mo stretchy="false">)</mo></mstyle></mrow></math>"^^http://www.w3.org/1998/Math/MathML
wdt: P5106
"bfs"
"breadthfirst"
wdt: P575
"1945-01-01T00:00:00+00:00"^^xsd:dateTime
wdt: P61
Konrad Zuse
wdt: P6366
"138843760"
wdt: P646
"/m/0p0jb"
wdt: P6564
"breadth-first-search-bfs"
wdt: P6706
"breadth-first+search"
wdt: P7502
"Breadth-first_search-8N4GJ"
wdt: P9100
"breadth-first-search"
wdt: P973
<https://www.javatpoint.com/ai-uninformed-search-algorithms>