The data set contains the source code and the measured values ​​of the master's thesis. This deals with the analysis of sport-specific problems, especially the championship problem. There are two projects on this topic. The first implements a set of network algorithms and tests runtime and graph-specific operations. The second project deals with a heuristic for the NP-complete problem. New concepts and ideas are implemented and tested with regard to runtime and iterations. The focus is on reducing the search space through the appropriate application of termination criteria. In addition, the search depths are critically examined and new parameters are introduced. Another sorting tool is used to prepare the original data. The fourth application implements some rating methods and compares the resulting ranking with the real table.