mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-17 14:58:10 +00:00
Code Issues Packages Projects Releases Wiki Activity

[pre-commit.ci] auto fixes from pre-commit.com hooks

Browse Source 
for more information, see https://pre-commit.ci
This commit is contained in:
pre-commit-ci[bot] 2024-11-18 04:10:31 +00:00
parent a92936bd01
commit 071ce716e4
1 changed files with 9 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
data_structures/heap/fibonacci_heap.py
View File

@ -12,6 +12,7 @@ Operations supported:
- Merge: O(1) - Merge: O(1)
""" """
class Node: class Node:
""" """
A node in a Fibonacci heap. A node in a Fibonacci heap.
@ -28,6 +29,7 @@ class Node:
degree: Number of children. degree: Number of children.
mark: Boolean indicating if node has lost a child. mark: Boolean indicating if node has lost a child.
""" """
def __init__(self, val): def __init__(self, val):
self.val = val self.val = val
self.parent = None self.parent = None
@ -324,8 +326,7 @@ class FibonacciHeap:
node: Starting node for cascading cut. node: Starting node for cascading cut.
""" """
parent = node.parent if parent := node.parent:
if parent:
if not node.mark: if not node.mark:
node.mark = True node.mark = True
else: else:
@ -359,4 +360,5 @@ class FibonacciHeap:
if __name__ == "__main__": if __name__ == "__main__":
import doctest import doctest
doctest.testmod() doctest.testmod()