Emre Sevinc wrote:
[ ... ]
This was a lovely feature. Believe me. People liked it.
i was in love with that since Orkut.
Now, people and the programmer are sorry. Why? Because
the aforementioned contacts table (I've given an example
in my previous mail, you can see it below, just includes
Emre Sevinc wrote:
-Original Message-
From: [EMAIL PROTECTED] on behalf of Can Burak Cilingir
Sent: Sat 12/17/2005 10:12 AM
To: cs-lisp@cs.bilgi.edu.tr
Cc: cs-discuss
Subject: Re: [cs-lisp] RE: Another programming challenge - Re:
[cs-discuss]PHP+MySQL versus Lisp: Shortest Path problemi
Title: RE: PHP+MySQL versus Lisp: Shortest Path problemi ile ilgili
-Original Message-
From: Can Burak Cilingir [mailto:[EMAIL PROTECTED]]
Sent: Sat 12/17/2005 11:15 AM
To: Emre Sevinc
Cc: cs-lisp@cs.bilgi.edu.tr; cs-discuss
Subject: Re: PHP+MySQL versus Lisp: Shortest Path problemi
[ ... ]
What you say is: Once your server is crunched and cached
the results of those queries, ok, it won't crash if the
same queries are made. But of course, each time brand new
queries with different Contacts are generated.
Could I make myself clear this time?
I was already clear on that
1.
OK we misunderstood the input format - it is neighbour lists, not pairs
of contacts, Emre's example test data misled us.
2.
My challenge to my students still stands (modified in the light of our
new information).
a) Modify the Graham code to work on pairs of contacts
b) Find the
Emre and everyone
Kod dzgn almyor
The Graham code , even with input in the correct format, does NOT work
correctly.
Consider this input
(shortest-path 1 54 '((1 5 ) (5 1 12 17) ( 12 26 28 55) (17 1)))
This should produce the answer () or nil, because there is no path from
1 to 54.
It
6 matches
Mail list logo
