MINHEAP Struct Reference
This structure holds a minheap tree that is used to keep track of what points that has the smallest effective area. More...
#include <effectivearea.h>
Collaboration diagram for MINHEAP:
Data Fields | |
| int | maxSize |
| int | usedSize |
| areanode ** | key_array |
Detailed Description
This structure holds a minheap tree that is used to keep track of what points that has the smallest effective area.
When eliminating points the neighbor points has its effective area affected and the minheap helps to resort efficient.
Definition at line 52 of file effectivearea.h.
The documentation for this struct was generated from the following file:
