I'm looking for the total number of circles, i.e. paths with the same starting- and endpoints but no loops inbetween in a complete, i.e. fully connected directed graph.
From Wolfram Alpha, I got a solution for an undirected, complete graph: http://mathworld.wolfram.com/CompleteGraph.html
I'd really appreciate your help.
Thanks, Chris