Representation of a rooted binary tree to hold a dendrogram. More...
#include <clustering.h>
Data Fields | |
int | clustnum |
double | height |
struct dgram * | left |
struct dgram * | right |
int | val |
Representation of a rooted binary tree to hold a dendrogram.
It is a terminal node if val>0 and left=right=NULL. Else it is an intermediate node that has at least one child!=NULL.
Definition at line 56 of file clustering.h.
int Dendrogram::clustnum |
number of cluster (index)
Definition at line 58 of file clustering.h.
double Dendrogram::height |
proportional to between sub-cluster distance
Definition at line 59 of file clustering.h.
struct dgram* Dendrogram::left |
Definition at line 60 of file clustering.h.
struct dgram* Dendrogram::right |
Definition at line 61 of file clustering.h.
int Dendrogram::val |
content representing object val; if val<0, its an intermediate node
Definition at line 57 of file clustering.h.