ふかゆうせんたんさく
深さ優先探索
1. depth-first searchComputing
2. Depth-first searchDepth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking. A version of depth-first search was investigated in the 19th century by French mathematician Charles Pierre Trémaux as a strategy for solving mazes.
Read “Depth-first search” on English Wikipedia
Read “深さ優先探索” on Japanese Wikipedia
Read “Depth-first search” on DBpedia
Read “Depth-first search” on English Wikipedia
Read “深さ優先探索” on Japanese Wikipedia
Read “Depth-first search” on DBpedia
Discussions
Log in to talk about this word.