Depth-First Search

From Wiki :-)
Revision as of 05:39, 3 June 2018 by Savoundg (talk | contribs) (Created page with "The Depth-First Search is a recursive algorithm that finds if there is a path from one node to another. This algorithm searches for the node's children first before going to...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

The Depth-First Search is a recursive algorithm that finds if there is a path from one node to another.

This algorithm searches for the node's children first before going to the neighbours.

Retrieved from "https://wiki.georges.savound.com/index.php?title=Depth-First_Search&oldid=673"