OpenMS
2.4.0
|
Elements of a binary tree used to represent a hierarchical clustering process. More...
#include <OpenMS/DATASTRUCTURES/BinaryTreeNode.h>
Public Member Functions | |
BinaryTreeNode (const Size i, const Size j, const float x) | |
constructor More... | |
~BinaryTreeNode () | |
destructor More... | |
BinaryTreeNode (const BinaryTreeNode &source) | |
copy constructor More... | |
BinaryTreeNode & | operator= (const BinaryTreeNode &source) |
assignment operator More... | |
Public Attributes | |
Size | left_child |
Size | right_child |
float | distance |
Private Member Functions | |
BinaryTreeNode () | |
Elements of a binary tree used to represent a hierarchical clustering process.
strict indexing/topology is assumed, i.e. node no. x represents clusteringstep no. x left_child and right_child are each the lowest indices to elements of the merged clusters, distance is the distance of the two children
BinaryTreeNode | ( | const Size | i, |
const Size | j, | ||
const float | x | ||
) |
constructor
~BinaryTreeNode | ( | ) |
destructor
BinaryTreeNode | ( | const BinaryTreeNode & | source | ) |
copy constructor
|
private |
BinaryTreeNode& operator= | ( | const BinaryTreeNode & | source | ) |
assignment operator
float distance |
Size left_child |
Size right_child |