475Rank
3Badges
440Score
Kees Roos submitted Solution 84030 to Problem 490. Fastest shortest-path-finder in the west
on 8 Oct 2012
Kees Roos submitted a Comment to Solution 86663
After many efforts, on my PC the time for 1000 vertices and 12000 arcs is now less than 1 sec. My solution is a variant of Dijkstra's algorithm. In fact, it surprises me that all shortest paths can be found so fast. I now stop trying to improve my code. After this solution I could see the leading-time solution which is quite different. Very nice!
on 8 May 2012
Kees Roos submitted Solution 86663 to Problem 490. Fastest shortest-path-finder in the west
on 8 May 2012
Kees Roos submitted Solution 86254 to Problem 490. Fastest shortest-path-finder in the west
on 7 May 2012
Kees Roos submitted Solution 85394 to Problem 490. Fastest shortest-path-finder in the west
on 3 May 2012
Kees Roos submitted Solution 85186 to Problem 490. Fastest shortest-path-finder in the west
on 3 May 2012
Kees Roos submitted Solution 84776 to Problem 145. Increment a number, given its digits
on 2 May 2012
Kees Roos submitted Solution 84731 to Problem 490. Fastest shortest-path-finder in the west
on 2 May 2012
Kees Roos submitted a Comment to Solution 84550
Dear Alfonso, thanks for doing this! Size now refers to msec's? I will now try to improve my code.
Is there a way to reproduce the new size on my PC?
on 2 May 2012
Kees Roos submitted Solution 84550 to Problem 490. Fastest shortest-path-finder in the west
on 2 May 2012
Kees Roos submitted Solution 82322 to Problem 490. Fastest shortest-path-finder in the west
on 1 May 2012
Kees Roos submitted Solution 82321 to Problem 490. Fastest shortest-path-finder in the west
on 1 May 2012
Kees Roos submitted Solution 82320 to Problem 490. Fastest shortest-path-finder in the west
on 1 May 2012
Kees Roos submitted Solution 81317 to Problem 490. Fastest shortest-path-finder in the west
on 1 May 2012
Kees Roos submitted Solution 81316 to Problem 490. Fastest shortest-path-finder in the west
on 1 May 2012
Kees Roos submitted Solution 81315 to Problem 490. Fastest shortest-path-finder in the west
on 1 May 2012
Kees Roos submitted Solution 81272 to Problem 490. Fastest shortest-path-finder in the west
on 1 May 2012
Kees Roos submitted Solution 81019 to Problem 490. Fastest shortest-path-finder in the west
on 1 May 2012
Kees Roos submitted Solution 80891 to Problem 490. Fastest shortest-path-finder in the west
on 1 May 2012
Kees Roos submitted Solution 80888 to Problem 490. Fastest shortest-path-finder in the west
on 1 May 2012
Kees Roos submitted Solution 84045 to Problem 25. Remove any row in which a NaN appears
on 30 Apr 2012
Kees Roos submitted Solution 84042 to Problem 17. Find all elements < 0 and > 10 and replace them with NaN
on 30 Apr 2012
Kees Roos submitted Solution 84040 to Problem 17. Find all elements < 0 and > 10 and replace them with NaN
on 30 Apr 2012
Kees Roos submitted a Comment to Solution 84030
When I run test problem 5 with my code on my PC the output is
Time (ms)
1.0e+04 *
0.006900000000000 0.657700000000000 1.714100000000000
In total this is well below 20 sec. It may be not the leading time, but it is kind of frustratng that the response of Cody is that the "server encountered an error". There is no error in the code; I am sure because I compared my solutions with those obtained by using the 'graphallshortestpaths.m' routine in the Bioinformatics toolbox of Matlab. I would like to know why I get no valid response from Cody.
on 30 Apr 2012
Kees Roos submitted a Comment to Solution 81313
Currently my code needs about 12 seconds for finding all shortest paths if the number of nodes is 1000 and the number of arcs 12000. Of course, I verified that the code is correct. But since I have no entrance to the last test problem, it is not clear why the server is not able to handle it. At least, I would be glad to be able to compare 'my' times with the leadng time.
on 25 Apr 2012
Kees Roos submitted Solution 78770 to Problem 283. Give the Shortest Path Through The Maze
on 18 Apr 2012
Kees Roos submitted Solution 78592 to Problem 283. Give the Shortest Path Through The Maze
on 18 Apr 2012
Kees Roos submitted Solution 77765 to Problem 54. Maximum running product for a string of numbers
on 17 Apr 2012
Kees Roos submitted a Comment to Solution 76528
I now understand. It is a pity that the Cody system does not report that the smaller problems are solved correctly. I guess the results you mention for large networks can be obtained only by commercial codes. I tried the code in the Bioinformatic toolbox. This would work, but needs a license.
on 17 Apr 2012
Kees Roos submitted Solution 77092 to Problem 132. given 3 sides, find area of this triangle
on 16 Apr 2012
Kees Roos submitted Solution 77085 to Problem 132. given 3 sides, find area of this triangle
on 16 Apr 2012
Kees Roos submitted Solution 77056 to Problem 290. Make one big string out of two smaller strings
on 16 Apr 2012
Kees Roos submitted Solution 77055 to Problem 180. Omit columns averages from a matrix
on 16 Apr 2012