Differences

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

--- courses:cs211:winter2012:journals:jeanpaul:chapterfour_sectionv [2012/03/01 02:14] – mugabej
+++ courses:cs211:winter2012:journals:jeanpaul:chapterfour_sectionv [2012/03/01 02:15] (current) – [Implementing Prim's Algorithm] mugabej
@@ Line 71: / Line 71: @@
 >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> u = delete min element from Q
 >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> S = S ∪ { u }
->>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> foreach (edge e = (u, v) incident to u)
+>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> for each (edge e = (u, v) incident to u)
->>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> if ((v ∉ S) and (ce < a[v]))
+>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> if (v ∉ S) and (c<sub>e</sub> < a[v])
->>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>decrease priority a[v] to ce
+>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>decrease priority a[v] to c<sub>e</sub>
 \\
 There are several applications of the Minimum Spanning Tree algorithms, many can be found in the book.\\
 This was by far the most interesting reading of the chapter!I give it a 9/10.