Moreover, let the number of edges with weight h be the same for every h ∈ N in C G and C H , hence there is a natural join. The goal is to generate all natural join edge sets B • to reconnect the connected components U ′ and W ′ derived from a cut. Let e ∈ C G and f ∈ C H and u ∈ U ′ , w ∈ W ′ such that u is incident with e and w is incident with f . We track whether to join u and w by an edge with weight ℓ(f ) by variable a ef such that a ef = 1 if u and w are joined by an edge, and a ef = 0 otherwise. This yields for the set of join edges B • = {uw | a ef = 1}. For the edge-weights in the join graph