Depth First Search
Everything on SkillVeris tagged Depth First Search — collected across the glossary, study notes, blog, and cheat sheets.
4 resources across 1 library
Interview Questions(4)
What is Backtracking?
Backtracking is a systematic search technique that builds a solution incrementally, one choice at a time, and abandons ("backtracks" from) any partial path as…
What are Inorder, Preorder, and Postorder Tree Traversals?
Inorder, preorder, and postorder are the three depth-first orders for visiting a binary tree's nodes, differing only in when the current node is visited relati…
What are Strongly Connected Components?
A strongly connected component (SCC) is a maximal set of vertices in a directed graph where every vertex can reach every other vertex in the set via a directed…
What are Articulation Points and Bridges in a Graph?
An articulation point (or cut vertex) is a vertex in an undirected graph whose removal increases the number of connected components, and a bridge is an edge wh…