Combinatorics Question

Given a complete graph with nodes N:

Whats the most uniform way to traverse it for any non-triangular number N?

This has driven me insane for a couple of years now, is there even a solution?

You're going to be a second tier and shit programmer as long as you don't know mathematics.