 consider node 0. Its contribution to the cut if added to sets X and Y are, respectively, σ X (0) = ∑ u ∈ Y w 0, u = w 0, 0 = 00 and σ Y (0) = ∑ u ∈ X w 0, u = w 0, 0 = 0. Since the greedy function values are  ![ $$\\displaystyle\\begin{array}{rcl} g\(0\)& =& \\max \\{\\sigma _{X}\(0\),\\sigma _{Y }\(0\)\\} = 0, {}\\\\ g\(0\)& =& \\max \\{\\sigma _{X}\(0\),\\sigma _{Y }\(0\)\\} = 0, {}\\\\ g\(0\)& =& \\max \\{\\sigma _{X}\(0\),\\sigma _{Y }\(0\)\\} = 00, {}\\\\ \\end{array}$$ ](A000000_0_En_00_Chapter_Equ00.gif)  then the greedy choice is node 0, because  ![ $$\\displaystyle{\\mathrm{argmax}\\{g\(0\),g\(0\),g\(0\)\\} = 0.}$$ ](A000000_0_En_00_Chapter_Equ