Originally Posted by denisT
hmm... it changes the rule of the original challenge...
the original task was to find all loops in ANY edge selection...
definitely you can organize your algorithm the way to process 'isolated loops' first. but it's just a step of the solution
I see ... I did not quite understand your requirements.
But my routine seems to work fine and fast for its purpose!