Compare commits
3 commits
cf6e1b8d14
...
dfdd65cd27
Author | SHA1 | Date | |
---|---|---|---|
Bruno BELANYI | dfdd65cd27 | ||
Bruno BELANYI | 3226918995 | ||
Bruno BELANYI | eb2245db21 |
|
@ -86,7 +86,7 @@ A naive Implementation of `find(...)` is simple enough to write:
|
|||
```python
|
||||
def find(self, elem: int) -> int:
|
||||
# If `elem` is its own parent, then it is the root of the tree
|
||||
if (parent: = self._parent[elem]) == elem:
|
||||
if (parent := self._parent[elem]) == elem:
|
||||
return elem
|
||||
# Otherwise, recurse on the parent
|
||||
return self.find(parent)
|
||||
|
@ -98,7 +98,7 @@ do a small optimization called _path splitting_.
|
|||
|
||||
```python
|
||||
def find(self, elem: int) -> int:
|
||||
while (parent: = self._parent[elem]) != elem:
|
||||
while (parent := self._parent[elem]) != elem:
|
||||
# Replace each parent link by a link to the grand-parent
|
||||
elem, self._parent[elem] = parent, self._parent[parent]
|
||||
return elem
|
||||
|
|
|
@ -1 +1 @@
|
|||
Subproject commit d545effed9949bf834eaed09ad423ec3e030794f
|
||||
Subproject commit 5da913dc46d2dadcaf6548256238c58c504476de
|
Loading…
Reference in a new issue