Here is the example I used to test my programs with.

There are 3 different “network configurations” (described in terms of cocktail parties of N people):

- There is a single host, that everyone knows. Everyone one also knows their two “neighbors” going around the circle.
- The party has 2 cliques (each of size N/2), each clique is like the first case.
- The same as the second configuration, except that each “non-host” also knows the corresponding person in the other clique.

Here are the three matrices for 3 different sized parties:

- for N=12 p12n400-0, p12x400-0, p12t400-0
- for N=18 p18n400-0, p18x400-0, p18t400-0
- for N=24 p24n400-0, p24x400-0, p24t400-0

If you want all 9 files in one ZIP, download this.