Merge pull request #1084 from cameroncuster/fix-disjoint-set-union-typo

jakobkogler · web-flow · commit 17ce6b5e6a98 · 2023-05-07T10:34:00.000+02:00
fix disjoint set union article typo
diff --git a/src/data_structures/disjoint_set_union.md b/src/data_structures/disjoint_set_union.md
@@ -381,7 +381,7 @@ Therefore we receive the formula ($\oplus$ denotes the XOR operation):
 
 $$t = x \oplus y \oplus 1$$
 
-Thus regardless of how many joins we perform, the parity of the edges is carried from on leader to another.
+Thus regardless of how many joins we perform, the parity of the edges is carried from one leader to another.
 
 We give the implementation of the DSU that supports parity. As in the previous section we use a pair to store the ancestor and the parity. In addition for each set we store in the array `bipartite[]` whether it is still bipartite or not.
 
