Finding all the cycles in a graph

Hi, I have an assignment to find all the cycles in a graph, I have to use depth first search. I understand DFS well enough, but unfortunately neither my text book or my assignment page explains how to find all of the cycles. I did some searching on google, but i mostly found unanswered questions and such, I was wondering if someone here can tell me how its done? Im not asking for you to write my code, but to just explain how its done.

I see Tarjans algorithm is common in the results that I find, but it seems thats more or less meant for strongly connected graphs, this doesnt necessarily have to be strongly connected so Im not sure it will work.

thanks to anyone who helps