Depth-first search
Jump to navigation
Jump to search
In computer science, depth-first search (DFS) is a method used for traversing a graph. It starts at an arbitrary item of a graph and explores as far as possible along each branch before backtracking.
Implementation[change | change source]
Recursive[change | change source]
void depthFirstSearch(Item root) {
if (root == null) return;
root.found = true;
for (Item neighbor : root.neighbors()) {
if (!neighbor.found) depthFirstSearch(n);
}
}