A priority queue is an abstract data type used in computer science that is similar to a conventional queue or stack data structure but includes an additional priority attribute for each entry.
An item with a high priority is served before an item with a low priority in a priority queue. A unique kind of queue called a priority queue has elements that are each assigned a priority value. Additionally, elements are treated according to their priority. In other words, more important factors come first. When two items with the same priority come up, they are handled in the order they appear in the queue. Priority queue can be used to implement Dijkstra's method effectively when the graph is stored as an adjacency list or matrix.
Learn more about Priority queue here-
https://brainly.com/question/15002672
#SPJ4
