Algorithm 1.
V = ∅ |
Lmax = 0; umax = 1; umin = 1 |
for u = 2 : Nr |
if g(u) > g(umax), then umax = u end |
if g(u) < g(umin), then umin = u end |
if Lmax |
if g(u) < g(umax) −δ, then umin = u, Lmax = 0 end |
else |
if g(u) > g(umin) +δ, V ← umin ∪ V, umax = u, Lmax = 1 end |
end |
end |