Welcome to Intel® Software Network Quick Login | Join | Help |
Search in Intel® Software Network Forums
in Go
Intel® Software Network › Intel® Software Network Talk B... › Intel® Threading Challenge Con... › Shortest Path Problem Set › Re: Winning solution for the Shortest Path problem set

Winning solution for the Shortest Path problem set

Last post 06-04-2008, 6:53 PM by mgarlanger. 3 replies.
Sort Posts: Previous Next
 06-03-2008, 10:21 AM 30256121  

Winning solution for the Shortest Path problem set

Attachment: tbb8.zip

Attached please find the winning solution and below further explanation for the May problem set, Shortest Path. Congratulations to DavidGeldreich for a job well done!

Shortest paths are computed using Dijkstra's algorithm. Each source node is examined in parallel using tbb::parallel_reduce. Top 20 smallest/largest paths are kept/merged using std::priority_queue.

 
 06-03-2008, 5:02 PM 30256164 in reply to 30256121  

Re: Winning solution for the Shortest Path problem set

Attachment: XShortest.rar
Congratulations DavidGeldreich 
Results people very disappointed, Attached My Code , 
Only the 224 points.
 
 06-04-2008, 7:59 AM 30256208 in reply to 30256121  

Re: Winning solution for the Shortest Path problem set

Congrats DavidGeldreich !

Well done, I love the fact that you used Dijkstra's algo (me too) :-)

I also like the use of reduce (I went with a pipeline).
 
 06-04-2008, 6:53 PM 30256288 in reply to 30256121  

Re: Winning solution for the Shortest Path problem set

Congratulations David.

....

Tonya/Clay - Are you going to post the detailed scoring criteria like you have done on the past contests?

Thanks,

  Mark
 
View as RSS news feed in XML

Shortcuts

View all users
My Tags
Tag This
Site Tag Cloud

Tags For This Post

...

Community Tags

...