80 likes | 249 Views
Bug Tracking Database Using a Binomial Heap. By: Ryan Colahan Nicholas Petrella. Binomial Heap. A set of binomial trees that satisfies the following properties: The key of a node is greater then or equal to the key of its parent.
E N D
Bug Tracking Database Using a Binomial Heap By: Ryan Colahan Nicholas Petrella
Binomial Heap • A set of binomial trees that satisfies the following properties: • The key of a node is greater then or equal to the key of its parent. • For any nonnegative integer k, there is at most one binomial tree in its' binomial heap H whose root has degree k. • Each node has a key and degree as well as pointers to its' parent, child and sibling. • Minimum key is easily accessible. • Minimum cost for unionizing two heaps.
Bug Tracking Database • Required fields: date the bug was found, priority (key - 9 choices) , and category (e.g. GUI, header, implementation, unknown, etc...). • Optional fields: name of file, developer's name, and description of bug. • Stores database to a text file and loads from one as well. • Bug with highest priority is shown on screen. To view full database we display text file. • Ability to merge two databases into one database taking only O(lg n) time.