The DAG-Tournament package
DAG-Tournament, where DAG stands for directed acyclic graph, is a graphical program to manage an informal tournament of games such as foosball. It is designed for open-for-all tournaments without schedule, for example to record all games as they happen in the free time program of a serious event, such as a conference.
Games can be entered as they happen. The program does not generate a complete ranking, but only visualizes what it knows about who is better than who based on direct comparison, or a path of direct comparisons. Cycles are broken at the edge of least significance. The visualisation is baesd on springs and forces and updated in real time, already producing entertaining effects.
DAG-Tournaments supports more than one tournament at the same time, e.g. foosball and pool billard, and can switch between the two rankings with one keypress, again showing an entaining shuffling of nodes until a stable state is reached again.
[Skip to Readme]
|Dependencies||base (==4.*), cairo, containers, directory, filepath, gtk, mtl, time [details]|
|Copyright||Joachim Breitner 2009|
|Author||Joachim Breitner <firstname.lastname@example.org>|
|Maintainer||Joachim Breitner <email@example.com>|
|Source repository||head: darcs get http://darcs.nomeata.de/DAG-Tournament|
|Uploaded||Sat Oct 10 10:38:44 UTC 2009 by JoachimBreitner|
|Downloads||381 total (5 in the last 30 days)|
|Status||Docs not available [build log]
All reported builds failed as of 2015-12-05 [all 6 reports]
For package maintainers and hackage trustees