possible ways in which the current node curr can result in an additional AP transition next. Since an AP may be available for a lengthy sequence of path indexes, some nodes will be further in assigning APs for the entire path. This is why each node keeps track of its own last waypoint reached LOC and last associated AP.
Since our search considers switching APs at every waypoint location, we know that all possible combinations of AP switches that minimize the number of handoffs will end up in the set Ndone. By selecting the plan that maximizes total RSSI across the entire plan, we will have a plan that minimizes the number of handoffs while optimally timing the handoffs so RSSI for both APs are strong at transition points.