Understanding DFS Edge Types
Introduction Depth-First Search or DFS in short, is a common graph traversal algorithm over graphs. Imagine that you are digging a hole in the ground. You could dig deep first and then widen the hole or do the opposite. Unlike…