Find Circular Gift Exchange Chains

Given a directed graph or mapping of who can give a gift to whom, identify all distinct circular gift-exchange chains (simple directed cycles of length ≥2) that satisfy constraints like no repeated participants and uniqueness up to rotation. The core challenge is enumerating or selecting valid directed cycles under size/coverage constraints efficiently (cycle detection/ enumeration in a directed graph, handling duplicates and overlap).