∀ d1, d2 ∈ D: ∃ (p [i] ∈ P [d1]) ∩ (p [j] ∈ P [d2]) ∩ (l ∈ p [i] ∩ l ∈ p [j])
Я хочу написать эти условия, но не знаю как!
Я пишу, как вы видите, это правильно?
{int} path[Demands][K_sp]=...; ( we have k_sp shortest pathes for each demand, that each shortest path includes index of links)
{int} Path[Demands]=...; (i insert all of index links for k_sp shortest paths a demand in this array)
forall (i in Demands, j in Demands : i!=j && card(Path[i] inter Path[j])!=0)
D[i][j]+D[j][i]==1;