Data-Structures-using-Python/Queue/PriorityQueue.py at master · OmkarPathak/Data-Structures-using-Python · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
# Author: OMKAR PATHAK

classPriorityQueue(object):
def__init__(self):
self.queue= []

def__str__(self):
return' '.join([str(i) foriinself.queue])

# for checking if the queue is empty
defisEmpty(self):
returnlen(self.queue) == []

# for inserting an element in the queue
definsert(self, data):
self.queue.append(data)

# for popping an element based on Priority
defdelete(self):
try:
max=0
foriinrange(len(self.queue)):
ifself.queue[i] >self.queue[max]:
max=i
item=self.queue[max]
delself.queue[max]
returnitem
exceptIndexError:
print()
exit()

if__name__=='__main__':
myQueue=PriorityQueue()
myQueue.insert(12)
myQueue.insert(1)
myQueue.insert(14)
myQueue.insert(7)
print(myQueue) # 12 1 14 7
whilenotmyQueue.isEmpty():
print(myQueue.delete(), end=' ') # 14 12 7 1
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
# Author: OMKAR PATHAK

classPriorityQueue(object):
def__init__(self):
self.queue= []

def__str__(self):
return' '.join([str(i) foriinself.queue])

# for checking if the queue is empty
defisEmpty(self):
returnlen(self.queue) == []

# for inserting an element in the queue
definsert(self, data):
self.queue.append(data)

# for popping an element based on Priority
defdelete(self):
try:
max=0
foriinrange(len(self.queue)):
ifself.queue[i] >self.queue[max]:
max=i
item=self.queue[max]
delself.queue[max]
returnitem
exceptIndexError:
print()
exit()

if__name__=='__main__':
myQueue=PriorityQueue()
myQueue.insert(12)
myQueue.insert(1)
myQueue.insert(14)
myQueue.insert(7)
print(myQueue) # 12 1 14 7
whilenotmyQueue.isEmpty():
print(myQueue.delete(), end=' ') # 14 12 7 1
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
# Author: OMKAR PATHAK

classPriorityQueue(object):
def__init__(self):
self.queue= []

def__str__(self):
return' '.join([str(i) foriinself.queue])

# for checking if the queue is empty
defisEmpty(self):
returnlen(self.queue) == []

# for inserting an element in the queue
definsert(self, data):
self.queue.append(data)

# for popping an element based on Priority
defdelete(self):
try:
max=0
foriinrange(len(self.queue)):
ifself.queue[i] >self.queue[max]:
max=i
item=self.queue[max]
delself.queue[max]
returnitem
exceptIndexError:
print()
exit()

if__name__=='__main__':
myQueue=PriorityQueue()
myQueue.insert(12)
myQueue.insert(1)
myQueue.insert(14)
myQueue.insert(7)
print(myQueue) # 12 1 14 7
whilenotmyQueue.isEmpty():
print(myQueue.delete(), end=' ') # 14 12 7 1
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
# Author: OMKAR PATHAK

classPriorityQueue(object):
def__init__(self):
self.queue= []

def__str__(self):
return' '.join([str(i) foriinself.queue])

# for checking if the queue is empty
defisEmpty(self):
returnlen(self.queue) == []

# for inserting an element in the queue
definsert(self, data):
self.queue.append(data)

# for popping an element based on Priority
defdelete(self):
try:
max=0
foriinrange(len(self.queue)):
ifself.queue[i] >self.queue[max]:
max=i
item=self.queue[max]
delself.queue[max]
returnitem
exceptIndexError:
print()
exit()

if__name__=='__main__':
myQueue=PriorityQueue()
myQueue.insert(12)
myQueue.insert(1)
myQueue.insert(14)
myQueue.insert(7)
print(myQueue) # 12 1 14 7
whilenotmyQueue.isEmpty():
print(myQueue.delete(), end=' ') # 14 12 7 1
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
# Author: OMKAR PATHAK

classPriorityQueue(object):
def__init__(self):
self.queue= []

def__str__(self):
return' '.join([str(i) foriinself.queue])

# for checking if the queue is empty
defisEmpty(self):
returnlen(self.queue) == []

# for inserting an element in the queue
definsert(self, data):
self.queue.append(data)

# for popping an element based on Priority
defdelete(self):
try:
max=0
foriinrange(len(self.queue)):
ifself.queue[i] >self.queue[max]:
max=i
item=self.queue[max]
delself.queue[max]
returnitem
exceptIndexError:
print()
exit()

if__name__=='__main__':
myQueue=PriorityQueue()
myQueue.insert(12)
myQueue.insert(1)
myQueue.insert(14)
myQueue.insert(7)
print(myQueue) # 12 1 14 7
whilenotmyQueue.isEmpty():
print(myQueue.delete(), end=' ') # 14 12 7 1
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
# Author: OMKAR PATHAK

classPriorityQueue(object):
def__init__(self):
self.queue= []

def__str__(self):
return' '.join([str(i) foriinself.queue])

# for checking if the queue is empty
defisEmpty(self):
returnlen(self.queue) == []

# for inserting an element in the queue
definsert(self, data):
self.queue.append(data)

# for popping an element based on Priority
defdelete(self):
try:
max=0
foriinrange(len(self.queue)):
ifself.queue[i] >self.queue[max]:
max=i
item=self.queue[max]
delself.queue[max]
returnitem
exceptIndexError:
print()
exit()

if__name__=='__main__':
myQueue=PriorityQueue()
myQueue.insert(12)
myQueue.insert(1)
myQueue.insert(14)
myQueue.insert(7)
print(myQueue) # 12 1 14 7
whilenotmyQueue.isEmpty():
print(myQueue.delete(), end=' ') # 14 12 7 1
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
# Author: OMKAR PATHAK

classPriorityQueue(object):
def__init__(self):
self.queue= []

def__str__(self):
return' '.join([str(i) foriinself.queue])

# for checking if the queue is empty
defisEmpty(self):
returnlen(self.queue) == []

# for inserting an element in the queue
definsert(self, data):
self.queue.append(data)

# for popping an element based on Priority
defdelete(self):
try:
max=0
foriinrange(len(self.queue)):
ifself.queue[i] >self.queue[max]:
max=i
item=self.queue[max]
delself.queue[max]
returnitem
exceptIndexError:
print()
exit()

if__name__=='__main__':
myQueue=PriorityQueue()
myQueue.insert(12)
myQueue.insert(1)
myQueue.insert(14)
myQueue.insert(7)
print(myQueue) # 12 1 14 7
whilenotmyQueue.isEmpty():
print(myQueue.delete(), end=' ') # 14 12 7 1
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
# Author: OMKAR PATHAK

classPriorityQueue(object):
def__init__(self):
self.queue= []

def__str__(self):
return' '.join([str(i) foriinself.queue])

# for checking if the queue is empty
defisEmpty(self):
returnlen(self.queue) == []

# for inserting an element in the queue
definsert(self, data):
self.queue.append(data)

# for popping an element based on Priority
defdelete(self):
try:
max=0
foriinrange(len(self.queue)):
ifself.queue[i] >self.queue[max]:
max=i
item=self.queue[max]
delself.queue[max]
returnitem
exceptIndexError:
print()
exit()

if__name__=='__main__':
myQueue=PriorityQueue()
myQueue.insert(12)
myQueue.insert(1)
myQueue.insert(14)
myQueue.insert(7)
print(myQueue) # 12 1 14 7
whilenotmyQueue.isEmpty():
print(myQueue.delete(), end=' ') # 14 12 7 1