Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | Next revisionBoth sides next revision | ||
| courses:cs211:winter2012:journals:jeanpaul:chapterthreesectionii [2012/01/31 00:13] – mugabej | courses:cs211:winter2012:journals:jeanpaul:chapterthreesectionii [2012/01/31 00:17] – mugabej | ||
|---|---|---|---|
| Line 27: | Line 27: | ||
| >>>>> | >>>>> | ||
| end while\\ | end while\\ | ||
| + | |||
| + | The R produced at the end of the algorithm is the //connected component of G containing s//. The BFS algorithms is usually used when we need to order nodes we visit in successive layers based on their distance from s.\\ | ||
| + | ==Depth-First Search== | ||
