| Non-adaptive
Algorithm |
|
|
|
|
|
|
|
|
|
|
| n | Adaptive
Algorithm: essentially breadth-first |
||||||||
| search,
nodes re-visited multiple times with |
|||||||||
| different
thresholds |
|||||||||
| n | Non-adaptive
algorithm: recursive, assumes that |
||||||||
| threshold
is set once, n times faster than Adaptive |
|||||||||
| Algorithm
(i.e., O(e)) |
|||||||||
| n | Applied
to same example: migrate nodes 1, 2, 6, 3, |
||||||||
| for a
benefit of 518 (i.e., less optimal) |
|||||||||
