To determine whether the network has an Eulerian circuit, check that every vertex has even degree and that the graph is connected.

In graph theory, Eulerian circuits provide a way to traverse every edge of a graph exactly once and return to the starting vertex.