39#include "filter/Filter.h"
40#include "score/Score.h"
42#include "math/ytGraph.h"
43#include "math/ytRNG.h"
45#define INGOR_DEFAULT_INFILE_TYPE "gdf"
46#define INGOR_DEFAULT_OUTPUT_TYPE "nodelist"
48#define INGOR_DEFAULT_SCORE_NAME "bnrc"
49#define INGOR_DEFAULT_ALGO_NAME "hc"
51#define INGOR_DEFAULT_SCORE_NAME "bndc"
52#define INGOR_DEFAULT_ALGO_NAME "cghc"
54#define INGOR_DEFAULT_CANDIDATES 10
55#define INGOR_DEFAULT_CANDIDATES_CONT 0
56#define INGOR_DEFAULT_CANDIDATES_DISC 0
57#define INGOR_DEFAULT_MAX_PARENTS 10
58#define INGOR_DEFAULT_MAX_PARENTS_CONT 10
59#define INGOR_DEFAULT_MAX_PARENTS_DISC 10
60#define INGOR_DEFAULT_TOTAL_MEMORY (1000)
61#define INGOR_DEFAULT_CACHE_RATIO (0.3)
98 char * constrainWrite;
99 char * constrainWriteType;
110 char * bootstrapMode;
112 char * bootstrapFile;
136 FilterArgs * filters;
178Args * Args_parse(
int argc,
char * argv[]);
Interface class for handling graph structure.
ytGraph * fixed
Fixed edges.
Definition Args.h:103
int singleFile
1 if multiple networks are output in a single file.
Definition Args.h:131
ytGraph * constrain
Constrain graph.
Definition Args.h:94
int bootstrap
not 0 if bootstrap enabled. The values are used as the ID of the execution.
Definition Args.h:109
int iteration
the number of iterations of performing network estimation.
Definition Args.h:128
double score
best score set by the algorithm.
Definition Args.h:139
int selfLoop
Definition Args.h:122
ytKeyValues * algoArgs
Definition Args.h:134
int candidates
The number of parent candidates.
Definition Args.h:76
ytGraph * init
Initial graph.
Definition Args.h:91
int verbose
verbose level.
Definition Args.h:147
ytRNG * rng
Random number generator.
Definition Args.h:142
ytData * bootstrapData
This is used for saving the ytData instance used in bootstrap resampling so that the generated instan...
Definition Args.h:113
General data container.
Definition ytData.h:73
Structure for encapsulating the random number generator.
Definition ytRNG.h:60