In graph theory, a tournament is a simple digraph whose underlying graph is complete, ie, a bunch of dots (vertex) with an arrow (arc) connecting each dot to every other dot. This is supposed to represent a tournament (webster's sense) in which each player (dot) plays (is connected to) every other player. The player at the head of the arrow is the loser of that game.