notes

Personal notes
git clone git://git.laack.co/notes.git
Log | Files | Refs

DepthFirstSearch.md (272B)

      1 # DFS
      2 
      3 CS202 L14
      4 
      5 **Definition:** Searching algorithm that traverses until reaching a leaf node then going back by one and doing the same on the other subtree.
      6 
      7 This normally uses the call [Stack](Stack.md) to search.
      8 
      9 Also see [BreadthFirstSearch](BreadthFirstSearch.md)