Python BinaryHeap示例

示例#1

文件： Priority_Queue.py 项目： chungtseng/Huffman_Code

class PriorityQueue:
    def __init__(self):
        self.order = BinaryHeap()
    def __str__(self):
        temp = self.order.copyHeap()
        front = temp.delete()
        string = ("<Front>\n")
        while front:
            string+= (" %s"%front)
            front = temp.delete()
        string += "<BACK>"
        return string
    def enQueue(self,Node):
        self.order.insert(Node)
    def deQueue(self):
        return self.order.delete()

示例#2

class PriorityQueue:
    def __init__(self):
        self.order = BinaryHeap()

    def __str__(self):
        temp = self.order.copyHeap()
        front = temp.delete()
        string = ("<Front>\n")
        while front:
            string += (" %s" % front)
            front = temp.delete()
        string += "<BACK>"
        return string

    def enQueue(self, Node):
        self.order.insert(Node)

    def deQueue(self):
        return self.order.delete()

示例#3

 def __init__(self):
     self.order = BinaryHeap()

示例#4

文件： Priority_Queue.py 项目： chungtseng/Huffman_Code

 def __init__(self):
     self.order = BinaryHeap()