Merge pull request cp-algorithms#1303 from ShubhamPhapale/patch-2

adamant-pwn · web-flow · commit ea9af5e8adde · 2024-07-11T16:18:34.000+02:00
Update disjoint_set_union.md
diff --git a/src/data_structures/disjoint_set_union.md b/src/data_structures/disjoint_set_union.md
@@ -375,7 +375,7 @@ If we add an edge $(a, b)$ that connects two connected components into one, then
 
 Let's derive a formula, which computes the parity issued to the leader of the set that will get attached to another set.
 Let $x$ be the parity of the path length from vertex $a$ up to its leader $A$, and $y$ as the parity of the path length from vertex $b$ up to its leader $B$, and $t$ the desired parity that we have to assign to $B$ after the merge.
-The path contains the of the three parts:
+The path consists of the three parts:
 from $B$ to $b$, from $b$ to $a$, which is connected by one edge and therefore has parity $1$, and from $a$ to $A$.
 Therefore we receive the formula ($\oplus$ denotes the XOR operation):
 
