This is the Graph visualizer for the Tournament Allocation Problem. Nodes represent players while edges are the conflicts between them. A conflict is any kind of undesired interaction in a tournament structure. For this specific instance, conflicts are matches between the same pair of players in the first round (+5), second round (+2), third round (+1), quarter and semi final rounds (+0.5) and players from the same country (+5). Node size is proportional to weighted degree, edges to their weights.

This webpage was built with Gephi, SigmaJS and a little help from Oxford. If you wish to know more about the mathematics and theoretical aspects behind, refer to the thesis available on gitHub.

MIT License
Copyright (c) 2018 Gabriele Dragotto