Dijkstra’s algorithm is an algorithm for finding the shortest paths between nodes in a graph.
Huffman coding is a lossless data compression algorithm and derives this table based on the estimated frequency of occurrence for each possible value of the source symbol.
Heap sort is a comparison-based sorting algorithm. It divides the input into a sorted and an unsorted region. It iteratively shrinks the unsorted region by extracting the largest element and moving that to the sorted region.
A priority queue is a data structure with each element associated with priority information. The high priority served before an element with low priority.
A priority queue is a data structure and each element has a priority associated with it. The high priority served before with low priority. The priority queue key will be unique. The priority queue can be implemented using Unordered linked list, ordered linked list, Ordered array, and balanced Binary search tree.