So putting it in graph theory terms, you're looking for graphs where there exists a path that allows you to visit all the nodes and return to your starting point while only traversing each edge at most once?

I'm not sure from your examples whether the edges are directed (i.e. only allowed to be followed in one particular direction).

If I were trying to solve this problem, I'd start with Graph or Graph::Easy.