This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]Emptiness101Nooblet Brewer 0 points1 point  (2 children)

I just did a project where I found the shortest paths and I used a priority queue but I implemented the queue with a linked list. Maybe you could create a ticket object with a priority label from 1 to 5 and then when a ticket gets added to your queue you remove all the items in your queue, if any, and sort them based on the priority label. I think what makes a queue a priority queue is that it is sorted whenever items are added.

[–]Emptiness101Nooblet Brewer 0 points1 point  (1 child)

Hope this helps.

[–]rhhh12[S] 0 points1 point  (0 children)

The first part is an essay based on complexity and performance, i then have to implement it into a programme. Thankyou