After each addition/deletion of an edge, the dynamic connectivity structure should adapt itself such that it can give quick answers to queries of the form "is there a path between x and y?" (equivalently: "do vertices x and y belong to the same connected component?").
Nakon svakog dodavanja/brisanja grane, struktura dinamičkog povezivanja bi trebalo da se adaptira tako da može davati brze odgovore na upite tipa "da li postoji put između čvorova x i y?" (ekvivalentno: "da li čvorovi x i y pripadaju istoj komponenti povezanosti?").