Differences

This shows you the differences between two versions of the page.

--- courses:cs211:winter2012:journals:jeanpaul:chapterthreesectionii [2012/01/31 00:12] – mugabej
+++ courses:cs211:winter2012:journals:jeanpaul:chapterthreesectionii [2012/01/31 00:17] – mugabej
@@ Line 20: / Line 20: @@
 R* = set of connected components (a set of sets)\\
 while there is a node that does not belong to R*\\
-select s not in R*\\
+>>>>>select s not in R*\\
-R = {s}\\
+>>>>>R = {s}\\
-while there is an edge (u,v) where u∋R and v∉R\\
+>>>>>while there is an edge (u,v) where u∋R and v∉R\\
-add v to R\\
+>>>>>>>>>>add v to R\\
-end while\\
+>>>>>end while\\
-Add R to R*\\
+>>>>>Add R to R*\\
 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===