title: Reuse my old Depth-First Tree for a bigger depth while searching the longest path
body: <p>I'm looking for the longest-path trough a map in a game which is turn based. I got 1s computation time and need to move at that point.</p>
  
  <p>Right now I'm generating the tree every move again. </p>
  
  <p>Is it possible to use my old tree and stack (in which I store the nodes yet to be visited) to get a bigger depth and thus a better result?</p>
  
  <p>For now my SearchClass is based on a Interface, thus changing the return-type and the input-variables of my function is a lot of work. Is there an easy solution for my problem?</p>