幅優先探索
プロメテウスに聞く
Concept
Breadth-first search is an algorithm for traversing a graph by exploring all nodes at a given hop count from a starting node before moving on to nodes at the next hop count.
Translations
- البحث المتسع الاول ar primary
- Breitensuche German primary
- breadth-first search English primary
- búsqueda en anchura Spanish primary
- algorithme de parcours en largeur French primary
- विस्तार-प्रधान खोज Hindi primary
- ricerca in ampiezza it primary
- 幅優先探索 ja primary
- 너비 우선 탐색 ko primary
- busca em largura pt primary
- поиск в ширину ru primary
- 广度优先搜索 zh primary
Etymology
Loading Wiktionary entry…