boB Stepp wrote:
> On Sun, Aug 13, 2017 at 3:52 AM, Peter Otten <__pete...@web.de> wrote:
>> boB Stepp wrote:
>> Still, a good unit test might be to initialise a RatingCalcultator with
>> different "highest possible ratings" and then verify for each instance
>> that actual ratings never exceed th
Martin A. Brown wrote:
> The image:
>
>> http://imgur.com/a/CwA2G
>
> To me, this looks like a 'graph', which is a more general data
> structure -- it does not look like a 'tree' (in the computer-science
> meaning of the term, anyway).
> import networkx as nx
While Martin's solution is certain
On 2017-08-13, boB Stepp wrote:
> REPORT GENERATION
>
> There are a variety of reports that I would like to be able to
> print to screen or paper. Things such as a "Top x List" of
> rated players, full rating list sorted from highest rating to
> lowest, rating lists for the current school year on
On 15/08/17 15:09, Neil Cerutti wrote:
>> There are a variety of reports that I would like to be able to
>> print to screen or paper. Things such as a "Top x List" of
>> rated players, full rating list sorted from highest rating to
>> lowest, rating lists for the current school year only or a
>>
On 14Aug2017 12:10, Michael C wrote:
http://imgur.com/a/CwA2G
Ok. So you have a graph like this:
1 -- 2 -- 3 -- 4
|
7 -- 5 -- 6 -- 8
Have a read of a graph theory textbook. Also, wikipedia has an article on
finding the shortest path through a graph:
https://en.wikipedia.org/wiki/
On Tue, Aug 15, 2017 at 12:29 PM, Alan Gauld via Tutor wrote:
> On 15/08/17 15:09, Neil Cerutti wrote:
>
>>> There are a variety of reports that I would like to be able to
>>> print to screen or paper. Things such as a "Top x List" of
>>> rated players, full rating list sorted from highest rating
