Method is_empty

graphs/minimum_spanning_tree_prims2.py:97–99

(self)

        return str(self.heap)

    def is_empty(self) -> bool:
        # Check if the priority queue is empty
        return self.elements == 0

    def push(self, elem: T, weight: int) -> None:
        # Add an element with given priority to the queue