New Topic/Question
Reply
I have implemented Floyd Warshall and Dijkstra in parallel for solving APSP. I have used adjacancy matrix as input for FW and adjacancy lists for D. However, now i have to describe my approach and say why i used these graph representations.
Could you guys give me some starting points.
(I have used them because the algorithm suggested that way - not a valid answer, btw).
Any links appreciated.
Thanks.
4 Replies - 775 Views - Last Post: 18 January 2012 - 10:35 AM
Topic Sponsor:
MultiQuoteReplies To: All Pairs Shortest Path - graph representation
#2
jon.kiparsky
- D.I.C Lover
-
Reputation: 1768
- Posts: 3,340
- Joined: 19-March 11
Re: All Pairs Shortest Path - graph representation
Posted 18 January 2012 - 10:22 AM
This sounds like a question that you have to answer for yourself. This is testing whether you understand what you've done, not whether I understand what you've done.
Was This Post Helpful?
0
#4
jon.kiparsky
- D.I.C Lover
-
Reputation: 1768
- Posts: 3,340
- Joined: 19-March 11
Re: All Pairs Shortest Path - graph representation
Posted 18 January 2012 - 10:34 AM
If you can't be bothered, I don't see why you're bothering to post at all, or why I'd bother to "get you started".
Was This Post Helpful?
0
Page 1 of 1
|
|
| 