深さ優先探索
ふ
か
さ
ゆ
う
せ
ん
た
ん
さ
く
Meanings
1
depth-first search
A graph traversal algorithm used in computing; explores as far as possible along each branch before backtracking.
Depth-first search is often used to solve mazes.
depth-first search
A graph traversal algorithm used in computing; explores as far as possible along each branch before backtracking.
Depth-first search is often used to solve mazes.