GitHub/quartz
1
0
Fork 2
mirror of https://github.com/jackyzha0/quartz.git synced 2025-12-24 13:24:05 -06:00
Code Issues Actions Packages Projects Releases Wiki Activity

vault backup: 2022-06-11 11:42:23

Browse Source
This commit is contained in:
Jet Hughes 2022-06-11 11:42:24 +12:00
parent 78d05f88bc
commit 564697a745
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
content/notes/union-find.md
View File

@ -159,7 +159,7 @@ If could happen that the sequence of Union operations does not create a rank tha
^this is an example of a semi-formal proof by [induction](notes/induction.md) ^this is an example of a semi-formal proof by [induction](notes/induction.md)
### 3.4 UF 4 ### 3.4 UF 4
Change find so it implements path compression to "flatten" the chains Change find so it implements path compression to "flatten" the chains. When we follow tht path to a nodes representative we "learn" the final result
```java ```java
if (x != reps[x]) { if (x != reps[x]) {