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 Real x) | |
| constructor | |
| ~BinaryTreeNode () | |
| destructor | |
| BinaryTreeNode (const BinaryTreeNode &source) | |
| copy constructor | |
| BinaryTreeNode & | operator= (const BinaryTreeNode &source) |
| assignment operator | |
Public Attributes | |
| Size | left_child |
| Size | right_child |
| Real | 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 Real | x | |||
| ) |
constructor
| ~BinaryTreeNode | ( | ) |
destructor
| BinaryTreeNode | ( | const BinaryTreeNode & | source | ) |
copy constructor
| BinaryTreeNode | ( | ) | [private] |
| BinaryTreeNode& operator= | ( | const BinaryTreeNode & | source | ) |
assignment operator
| OpenMS / TOPP release 1.10.0 | Documentation generated on Thu Mar 7 2013 09:42:51 using doxygen 1.7.1 |