Any suggestions?
Hi.
How do I go about finding all the cycles (where the only vertex being repeated is the starting one) in an undirected graph?
With each cycle found, I would like to perform some calculation on it's total length and make comparisons with the lengths of the rest of the cycles' lengths.
I realize that Depth-first-search is a valid option to go about checking all possibilities but I would like to perform this task in a time faster than that.