5.5.0.0.2 Output:

$\bullet$

a connected component $VDC' \subseteq$ $VD$ such that $\forall vd_{i} \in$ $VDC'$ there $\exists$ at least one $vm_{i} \in$ $VM$ such that $vmap'(vm_{i}) = vd_{i}$ and $\sum_{\forall vd_i,vd_j \in VDC'} cost(vde_{i,j})$ is minimum over the set of all possible connected components