Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionNext revisionBoth sides next revision | ||
courses:cs211:winter2011:journals:charles:chapter6 [2011/03/30 04:41] – [6.8 Shortest Paths in a Graph] gouldc | courses:cs211:winter2011:journals:charles:chapter6 [2011/04/05 05:29] – [6.8 Shortest Paths in a Graph] gouldc | ||
---|---|---|---|
Line 51: | Line 51: | ||
We do this by incorporating divide-and-conquer principles into our algorithm. I'm slightly confused by the divide-and-conquer component to this problem. In class we did it with the graph in Figure 6.19. We started in the top left and found the shortest path to some midpoint, then we did the same thing from the bottom right. I will need to look in more depth at the pseudo-code on page 288 to get a better grasp of the concept. | We do this by incorporating divide-and-conquer principles into our algorithm. I'm slightly confused by the divide-and-conquer component to this problem. In class we did it with the graph in Figure 6.19. We started in the top left and found the shortest path to some midpoint, then we did the same thing from the bottom right. I will need to look in more depth at the pseudo-code on page 288 to get a better grasp of the concept. | ||
===== 6.8 Shortest Paths in a Graph ===== | ===== 6.8 Shortest Paths in a Graph ===== | ||
- | Shortest | + | Problem outline: We want to find the shortest |
- | We want the path from s -> t that minimizes | + | Here we assume no negative cycles because otherwise |
- | (6.23) //OPT(i,v) = min(OPT(i-1, | + | (6.25) says that the shortest path algorithm can run in O(mn) time. |
+ | |||
+ | ===== 6.9 Shortest Paths and Distance Vector Protocols ===== |