A walk like Dijkstra's algorithm. If an edge ever leads back to a visited node, there is a cycle. I'm pretty sure this could be done in linear time -- no recu

A walk like Dijkstra's algorithm. If an edge ever leads back to a visited node, there is a cycle. I'm pretty sure this could be done in linear time -- no recursion required.