Every graph node is connected with every other node. There are N * (N - 1)/2 edges.

Question

In a graph, every node is connected with every other node, with no redudant connections.

That is, if A->B then B doesn't need to go to A. It is still one connection.

I know that there are N * (N - 1)/2 Edges.

In a loop, it would look like,

for(int i = 0; i < n - 1; i++)
    for(int j = i + 1; j < n; j++)

I can't remember the formal definition for this. What is it called?

Answer 1

Complete Graph

Answer 2

You mean Complete?

Answer 3

Strongly connected graph I think?