幅はば優ゆう先せん探たん索さく

noun

breadth-first search

A graph traversal algorithm that explores all neighbor nodes at the present depth before moving on to nodes at the next depth level. Used in computing and algorithm contexts.

• 幅はば優ゆう先せん探たん索さくは最さい短たん経けい路ろ問もん題だいによく使つかわれる。

  Breadth-first search is often used for shortest path problems.

• このグラフに幅はば優ゆう先せん探たん索さくを適てき用ようすると、訪ほう問もん順じゅん序じょが決きまる。

  Applying breadth-first search to this graph determines the order of visits.