Update 1168.optimize-water-distribution-in-a-village-en.md

subhamtulshan · web-flow · commit 25225295829b · 2022-03-27T15:38:58.000+05:30
diff --git a/problems/1168.optimize-water-distribution-in-a-village-en.md b/problems/1168.optimize-water-distribution-in-a-village-en.md
@@ -66,7 +66,7 @@ As below pic:
 From pictures, we can see that all nodes already connected with minimum costs.
 
 #### Complexity Analysis
-- *Time Complexity:* `O(ElogE) - E number of edge in graph`
+- *Time Complexity:* `O(ElogE + ElogV) - E number of edge in graph, to do the operation in the union and find for each edge in the list
 - *Space Complexity:* `O(E)`
 
 
@@ -191,4 +191,4 @@ class Solution:
 4. [Bellman–Ford algorithm](https://www.wikiwand.com/en/Bellman%E2%80%93Ford_algorithm)
 5. [Kruskal's algorithm](https://www.wikiwand.com/en/Kruskal%27s_algorithm)
 6. [Prim's algorithm](https://www.wikiwand.com/en/Prim%27s_algorithm)
-7. [Minimum spanning tree](https://www.wikiwand.com/en/Minimum_spanning_tree)
+7. [Minimum spanning tree](https://www.wikiwand.com/en/Minimum_spanning_tree)
