“…= then (9) all nodes in component changes its component to ; (10) end if (11) end for (12) while true do (13) mnn min ← −1, pair ← Φ; (14) for each edge , ∈ that ( , ) > do (15) if ! = then (16) mnn 1 ← Exist-UAV-Chain( , , , , , ); (17) mnn 2 ← New-UAV-Chain( , , , , ); (18) mnn ← min(mnn 1 , mnn 2 ); (19) if mnn < mnn min ||mnn min < 0 then (20) mnn (3) get UAV chain from 1 to 2 (4) for each UAV ∈ do (5) get left node and right node ; (6) compute three candidate positions CP 1 , CP 2 , CP 3 ; (7) choose one position CP with highest priority and satisfy dist( , CP ) ≤ , here = 1, 2, 3; (8) ← CP ; (9) end for (10) for each edge in chain do (11) test | | with and add new UAVs to ; (12) ← ∪ ; (13) end for (14) return , ;…”