Hi MrPetovan,

Thank you very much for taking the time to explain it!!
sorry, I feel a bit stupid but I still didn’t get it =/
the way I’m trying to do is for each vertex of the graph I create a spanning tree using dfs
than for each vertex of the spanning tree I check if it is connected to the first vertex
it finds all the cycles but each one in a diferen order
here is what I have in python http://pastebin.com/54ePuQia
if you have a graph on that format:
graph = {vtx:[adjacent1, adjacent2, adjacent3], …}
what would be the Pseudocode to reorient those vertex connections to be in clockwise order or counter clockwise order?