Method __init__

Graphs/dijkstra_algorithm.py:13–16

(self)

class PriorityQueue:
    # Based on Min Heap
    def __init__(self):
        self.cur_size = 0
        self.array = []
        self.pos = {}   # To store the pos of node in array

    def isEmpty(self):
        return self.cur_size == 0