Software Engineering :: Data Structures & Algorithms :: DFS
⪼ Made with 💜 by Polyglot.
Depth first Search or Depth first traversal is a recursive algorithm for searching all the vertices of a graph or tree data structure. Traversal means visiting all the nodes of a graph.