Markus Schulze a écrit :
> Dear David,
>
> you wrote (18 Dec 2003):
> > I know a few 'shortest path' algorithm like "Dijkstra" and
> > "Bellman-Ford". Dijkstra is having an 0(n*Log(n)) complexity (in time)
> > and for the other... I don't remember but it is a more distributed
> > algorithm.
If I
Dear David,
you wrote (18 Dec 2003):
> I know a few 'shortest path' algorithm like "Dijkstra" and
> "Bellman-Ford". Dijkstra is having an 0(n*Log(n)) complexity (in time)
> and for the other... I don't remember but it is a more distributed
> algorithm.
Bellman-Ford, Dijkstra, and Floyd have the p
Ernest Prabhakar wrote:
Can we chill? We're all Condorcet-lovers, after all. Mike probably
used the term Floyd inappropriately. Markus probably cited a poor
example. Everybody makes mistakes.No injury, no foul.
I love flame war... especially those where I don't understand a word.
I su
Hi guys,
On Dec 18, 2003, at 7:32 AM, Markus Schulze wrote:
You wrote (18 Dec 2003):
Idiot, why don't you read the quoted passage above, from my e-mail.
Did I
deny that I'd called my implementation the Floyd algorithm? The only
thing
that I denied having called "the Floyd algorithm" was your
po
