CseWay
A Way For Learning
Priority Queue
Applications:
Data compression : Huffman Coding
Shortest path algorithms : Dijkstra
Minimum spanning tree algorithms : Prims
Event-Driven simulation : customers in a line
Selection Problem : finding Kth smallest element
Useful Resources:
http://pages.cs.wisc.edu/~vernon/cs367/notes/11.PRIORITY-Q.html
No comments:
Post a Comment
‹
›
Home
View web version
No comments:
Post a Comment