mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-16 02:37:36 +00:00
Code Issues Packages Projects Releases Wiki Activity

Added tests and docstrings to fibonacci_heap.py

Browse Source
This commit is contained in:
mcawezome 2024-11-18 12:12:17 +08:00
parent 071ce716e4
commit bd943b086a
1 changed files with 7 additions and 9 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,7 +12,6 @@ Operations supported:
- Merge: O(1) - Merge: O(1)
""" """
class Node: class Node:
""" """
A node in a Fibonacci heap. A node in a Fibonacci heap.
@ -29,7 +28,6 @@ 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
@ -326,7 +324,8 @@ class FibonacciHeap:
node: Starting node for cascading cut. node: Starting node for cascading cut.
""" """
if parent := node.parent: parent = node.parent
if parent:
if not node.mark: if not node.mark:
node.mark = True node.mark = True
else: else:
@ -360,5 +359,4 @@ class FibonacciHeap:
if __name__ == "__main__": if __name__ == "__main__":
import doctest import doctest
doctest.testmod() doctest.testmod()