1. 03 Oct, 2019 1 commit
    • Michael Tremer's avatar
      Implement search through the network tree · e3f696c1
      Michael Tremer authored
      This could not be implemented as a usual DFS since we cannot simply
      have a recursive solution here and need to be able to break the
      search at any time.
      
      However, it needs to be tracked where in the graph we are when we
      are walking through it to extract the informaton encoded into the
      edges.
      
      This is now solved by using a stack that keeps that information
      as we walk through the graph.
      
      This solution uses O(1) in memory since the stack can not be larger
      than 256 nodes (the maximum path length should be 128).
      Signed-off-by: default avatarMichael Tremer <michael.tremer@ipfire.org>
      e3f696c1
  2. 02 Oct, 2019 2 commits
  3. 12 Jan, 2019 4 commits
  4. 01 Feb, 2018 12 commits
  5. 31 Jan, 2018 3 commits
  6. 30 Jan, 2018 11 commits
  7. 25 Jan, 2018 3 commits
  8. 08 Jan, 2018 4 commits