How can I find a cycle in a graph using only log space?

I need an algorithm that will use log space to find if a graph has a cycle in it or not. You can reuse space, but in total you can only use a log of the number of nodes in the graph at a given time. Plz help :(