Ah that’s a really interesting approach. As far as I know there is no purely topological method for finding such graph cycles, but I might well be wrong here, it’s been a while. Anywho, it looks like the RhinoCommon method indeed might work for that purpose:
240216_BooleanRegions_GHPython_01.gh (11.1 KB)