[EM] David Gambld reply, 25/1/04, 0620
Markus Schulze
markus.schulze at alumni.tu-berlin.de
Mon Jan 26 16:32:49 PST 2004
Dear Mike,
you wrote (25 Jan 2004):
> If you believe that I was unreasonable to lose patience with Markus's
> endless repetitions of replies to things that I'd never said, and
> mis-statements of what I had said, that's your subjective judgement.
Well, you did mistakenly claim that you had implemented the Floyd algorithm.
I gave concrete quotations where you mistakenly claimed that you had
implemented the Floyd algorithm. I do not care why you mistakenly believed
that you had implemented the Floyd algorithm. But it is clear that when we
discussed how to calculate the strengths of the beatpaths it was necessary
for me to stress that your implementation was not the Floyd algorithm.
*********
In your python code, you wrote:
> Determine "beatpath" magnitudes array using the Floyd Algorithm:
> Def[i,j] will be the maximum beatpath magnitudes array. The i,j
> entry is the greatest magnitude of any beatpath from i to j. A
> beatpath's magnitude is the magnitude of its weakest defeat.
But the then used algorithm was clearly not the Floyd algorithm:
> changing = 1
>
> while changing:
>
> changing = 0
>
> for i in range(nc):
> for j in range(nc):
> for k in range(nc):
>
> dmin = min ( Def[i,j], Def[j,k] )
>
> if Def[i,k] < dmin:
> Def[i,k] = dmin
> changing = 1
In this python code, you also wrote:
> Mike Ossipoff provided the algorithm, and Russ Paielli programmed it.
In so far as I gave a concrete quotation where you mistakenly called
your implementation "Floyd algorithm", how can you still claim that I
misquoted you? Again: I do not care why you mistakenly believed that you
had implemented the Floyd algorithm. But it is clear that when we discussed
how to calculate the strengths of the beatpaths it was necessary for me to
stress that your implementation was not the Floyd algorithm.
Markus Schulze
More information about the Election-Methods
mailing list