|
| How it works (technical stuff)
The back-end of this program is a CGI script written in perl. When executed, the program reads in
a flat text file containing all the scores for a particular season. It then builds a
directed graph structure
representing the results of that season. Each team is represented by a unique vertex in the graph, and each
team has an adjacency list containing all the opponents
they beat.
The program attempts to find the shortest chain/path between two teams by conducting a Breadth-first Search. If a path between
two teams is impossible, the program will report accordingly.
While I have no reason to doubt the accuracy of this program, it can only be as
accurate as the scores files being used. If you notice an error in any chain,
please e-mail me with the year, and what was wrong with
the chain (i.e. a certain team didn't beat the team listed). I will look into what the problem might
be.
|
|