What does a graph look like where each node is connected to all other nodes (without redundant connections)?
I know that this graph has N * (N - 1) / 2 edges.
Full schedule