You signed in with another tab or window.Reload to refresh your session.You signed out in another tab or window.Reload to refresh your session.You switched accounts on another tab or window.Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: en/1001-2000/1971-find-if-path-exists-in-graph-2.md
+2-2Lines changed: 2 additions & 2 deletions
Original file line number
Diff line number
Diff line change
@@ -101,8 +101,8 @@ class Solution:
101
101
102
102
###Another UnionFind algorithm (using a map and an array of set)
103
103
* This solution is slower than the`standard UnionFind algorithm`, but it is straightforward.
104
-
* The applicability of this solution is not as wide as the`standard UnionFind algorithm` because data in a set don't have association.
105
-
The`standard UnionFind algorithm`has a`parent` array with association ofnodes.
104
+
* The applicability of this solution is not as wide as the`standard UnionFind algorithm` because data in a set don't have association, yet the`standard UnionFind algorithm` has a`parents` array with association of nodes.
105
+
*The`standard UnionFind algorithm`should be the first choice instead ofthis one.