10000 Remove `` · cp-algorithms/cp-algorithms@3969ea6 · GitHub
[go: up one dir, main page]

Skip to content

Commit 3969ea6

Browse files
authored
Remove ``
1 parent 8551109 commit 3969ea6

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

src/data_structures/disjoint_set_union.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -98,7 +98,7 @@ The trick is to make the paths for all those nodes shorter, by setting the paren
9898
You can see the operation in the following image.
9999
On the left there is a tree, and on the right side there is the compressed tree after calling `find_set(7)`, which shortens the paths for the visited nodes 7, 5, 3 and 2.
100100
101-
![Path compression of call `find_set(7)`](DSU_path_compression.png)
101+
![Path compression of call find_set(7)](DSU_path_compression.png)
102102
103103
The new implementation of `find_set` is as follows:
104104

0 commit comments

Comments
 (0)
0