SHOGUN  v3.2.0
Macros | Functions
orderTree.h File Reference

Go to the source code of this file.

Macros

#define IGNORE_IN_CLASSLIST
 

Functions

void readFromFile (char *FileName, struct ChildrenNum **TreeInfo, int n)
 
void buildTree (struct Node *root, struct ChildrenNum *treeInfo, double *u)
 
void initializeRoot (struct Node **Root, char *FileName, double *u, int rootNum, int n)
 
void initializeRootBinary (struct Node **Root, double *u, int n)
 
void initializeRootDepth1 (struct Node **Root, double *u, int n)
 
void merge (struct Node *root, struct Node *maxNode)
 
void computeMaximalMean (struct Node *root)
 
void computeMaximalMean_without_nonnegative (struct Node *root)
 
void computeSolution (double *x, struct Node *root)
 
void traversalTree (struct Node *root)
 
void deleteTree (struct Node *root)
 
void orderTree (double *x, char *FileName, double *u, int rootNum, int n)
 
void orderTree_without_nonnegative (double *x, char *FileName, double *u, int rootNum, int n)
 
void orderTreeBinary (double *x, double *u, int n)
 
void orderTreeDepth1 (double *x, double *u, int n)
 

Macro Definition Documentation

◆ IGNORE_IN_CLASSLIST

#define IGNORE_IN_CLASSLIST

Definition at line 20 of file orderTree.h.

Function Documentation

◆ buildTree()

void buildTree ( struct Node *  root,
struct ChildrenNum *  treeInfo,
double *  u 
)

Definition at line 214 of file orderTree.h.

◆ computeMaximalMean()

void computeMaximalMean ( struct Node *  root)

Definition at line 549 of file orderTree.h.

◆ computeMaximalMean_without_nonnegative()

void computeMaximalMean_without_nonnegative ( struct Node *  root)

Definition at line 632 of file orderTree.h.

◆ computeSolution()

void computeSolution ( double *  x,
struct Node *  root 
)

Definition at line 717 of file orderTree.h.

◆ deleteTree()

void deleteTree ( struct Node *  root)

Definition at line 792 of file orderTree.h.

◆ initializeRoot()

void initializeRoot ( struct Node **  Root,
char *  FileName,
double *  u,
int  rootNum,
int  n 
)

Definition at line 274 of file orderTree.h.

◆ initializeRootBinary()

void initializeRootBinary ( struct Node **  Root,
double *  u,
int  n 
)

Definition at line 336 of file orderTree.h.

◆ initializeRootDepth1()

void initializeRootDepth1 ( struct Node **  Root,
double *  u,
int  n 
)

Definition at line 418 of file orderTree.h.

◆ merge()

void merge ( struct Node *  root,
struct Node *  maxNode 
)

Definition at line 494 of file orderTree.h.

◆ orderTree()

void orderTree ( double *  x,
char *  FileName,
double *  u,
int  rootNum,
int  n 
)

Definition at line 834 of file orderTree.h.

◆ orderTree_without_nonnegative()

void orderTree_without_nonnegative ( double *  x,
char *  FileName,
double *  u,
int  rootNum,
int  n 
)

Definition at line 877 of file orderTree.h.

◆ orderTreeBinary()

void orderTreeBinary ( double *  x,
double *  u,
int  n 
)

Definition at line 921 of file orderTree.h.

◆ orderTreeDepth1()

void orderTreeDepth1 ( double *  x,
double *  u,
int  n 
)

Definition at line 968 of file orderTree.h.

◆ readFromFile()

void readFromFile ( char *  FileName,
struct ChildrenNum **  TreeInfo,
int  n 
)

Definition at line 114 of file orderTree.h.

◆ traversalTree()

void traversalTree ( struct Node *  root)

Definition at line 752 of file orderTree.h.


SHOGUN Machine Learning Toolbox - Documentation