title: Marking nodes in Graph?
body: <p>I am currently learning some search algorithms and I am curious to know how would the performance of Depth-first search being effected, if we don't mark the nodes that we have visited (in other words, we re-visit nodes) in a directed acyclic graph? </p>