mitkNodeHeap Class Reference
mitkNodeHeap - a class that define mitkNodeHeap used by mitkFastMarchingImageFilter
More...
#include <mitkNodeHeap.h>
Collaboration diagram for mitkNodeHeap:
[legend]List of all members.
Detailed Description
mitkNodeHeap - a class that define mitkNodeHeap used by mitkFastMarchingImageFilter
mitkNodeHeap defines a min-nodeHeap. The top of the heap is always the minimal of the elements in the heap.
Constructor & Destructor Documentation
mitkNodeHeap::mitkNodeHeap |
( |
|
) |
|
|
mitkNodeHeap::~mitkNodeHeap |
( |
|
) |
|
|
Member Function Documentation
bool mitkNodeHeap::empty |
( |
|
) |
|
|
|
Check if the heap is empty - Returns:
- Return true if the heap is empty otherwise return false.
|
void mitkNodeHeap::pop |
( |
|
) |
|
|
|
remove the top node of the heap. |
void mitkNodeHeap::push |
( |
mitkNode |
node |
) |
|
|
|
Push a node into the heap. - Parameters:
-
| node | Represent the node to put into the heap |
|
|
Get the top node of the heap. - Returns:
- Return the top node of the heap which is also the minimal element of the heap.
|
The documentation for this class was generated from the following file:
Generated on Tue Feb 25 15:04:12 2014 for MITK (Medical Imaging ToolKit) by
1.4.3