Method pop

algorithms/data_structures/priority_queue.py:103–109

Remove and return the item with the lowest priority. Returns: The data of the lowest-priority node.

(self)

        self.priority_queue_list.append(node)

    def pop(self) -> Any:
        """Remove and return the item with the lowest priority.

        Returns:
            The data of the lowest-priority node.
        """
        return self.priority_queue_list.pop().data