title: Modify depth-first search to work within a specific radius
body: <p>Suppose you have a weighted graph. Starting from a random node, how can you use depth first search (modify the iterative algorithm that uses an explicit stack) to check which nodes exist within a certain weight radius? (Are reachable from this node in a specific weight.)</p>