Euler circuits A

One of six forms of Euler circuits in the complete directed graph on four vertices.

Think of four cities, each pair connected by a two-way road; how many ways can you drive a loop that uses all the roads, both ways, once each?

This curvy path is a Fourier interpolation that matches the velocity vector at the middle of each edge.