Tag Archives: priority queue

Compare a list priority queue to a heap priority queue in C#

My book Essential Algorithms: A Practical Approach to Computer Algorithms describes lots of other interesting data structures and algorithms, many just as interesting but less complicated than this one. For more information about queues, priority queues, trees and other algorithmic … Continue reading

Posted in algorithms, classes, generic, mathematics, OOP | Tagged , , , , , , , , , , , , | 1 Comment

Make an efficient priority queue class in C#, Part 2

My book Essential Algorithms: A Practical Approach to Computer Algorithms describes lots of other interesting data structures and algorithms, many just as interesting but less complicated than this one. For more information about queues, priority queues, trees and other algorithmic … Continue reading

Posted in algorithms, classes, generic, mathematics, OOP | Tagged , , , , , , , , , , , , | Leave a comment

Make an efficient priority queue class in C#, Part 1

For more information about queues, priority queues, trees and other algorithmic topics, see my book Essential Algorithms: A Practical Approach to Computer Algorithms. A priority queue is a data structure that holds data values with associated priorities. The Enqueue method … Continue reading

Posted in algorithms, classes, generic, mathematics, OOP | Tagged , , , , , , , , , , , , | 1 Comment

Make a generic priority queue class in C#

This example shows how to make a generic priority queue class. A generic class is similar to a regular class except it can take one or more parameters that are types. The class can then use the type to define … Continue reading

Posted in classes, generic, OOP | Tagged , , , , , , , , , | 3 Comments