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:wendy:chapter4 [2011/02/16 02:08] – [Section 4: Shortest Paths in a Graph] shangw | courses:cs211:winter2011:journals:wendy:chapter4 [2011/02/16 02:37] – [Section 4: Shortest Paths in a Graph] shangw | ||
|---|---|---|---|
| Line 27: | Line 27: | ||
| ===== Section 4: Shortest Paths in a Graph ===== | ===== Section 4: Shortest Paths in a Graph ===== | ||
| + | This section introduces the third example of greedy algorithm: finding the shortest paths. | ||
| + | The problem is just as what its name describes, given a directed graph, assigned a node s, how to find the path from s to every other node that is the " | ||
