From 0ad91d8bcce2d56353a1284a25f21e9bd80b835c Mon Sep 17 00:00:00 2001 From: Aayush Vyas <70998175+AayushVyasKIIT@users.noreply.github.com> Date: Wed, 1 Sep 2021 07:16:30 +0530 Subject: [PATCH] Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal --- data_structures/dsu_path_compression.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/data_structures/dsu_path_compression.cpp b/data_structures/dsu_path_compression.cpp index 522deaf72..4bf75ba0e 100644 --- a/data_structures/dsu_path_compression.cpp +++ b/data_structures/dsu_path_compression.cpp @@ -2,7 +2,7 @@ * @file * @brief [DSU(Disjoint sets)](https://en.wikipedia.org/wiki/Disjoint-set-data_structure) * @details - * dsu : It is a very powerful data structure which keeps track of different + * DSU: It is a very powerful data structure that keeps track of different * clusters(sets) of elements, these sets are disjoint(doesnot have a common element). * Disjoint sets uses cases : for finding connected components in a graph, * used in Kruskal's algorithm for finding Minimum Spanning tree.