Graph Struct Reference

Dynamical GP graph data structure. More...

#include <dgp.h>

Data Fields
bool	evolve_cycles
	Whether to evolve the number of update cycles. More...
double *	initial_state
	Initial node states. More...
double *	state
	Current state of each node. More...
double *	tmp_input
	Temporary storage for updating the graph. More...
double *	tmp_state
	Temporary storage for synchronous update. More...
int *	connectivity
	Connectivity map. More...
int *	function
	Node activation functions. More...
int	klen
	Length of connectivity map. More...
int	max_k
	Maximum number of connections a node may have. More...
int	max_t
	Maximum number of update cycles. More...
int	n
	Number of nodes. More...
int	n_inputs
	Number of inputs to the graph. More...
int	t
	Number of cycles to run. More...
double *	mu
	Mutation rates. More...

Detailed Description

Dynamical GP graph data structure.

Definition at line 42 of file dgp.h.

Field Documentation

connectivity

int* Graph::connectivity

Connectivity map.

Definition at line 48 of file dgp.h.

Referenced by xcsf.utils.viz.DGPViz::__init__(), xcsf.utils.viz.DGPViz::draw(), graph_copy(), graph_free(), graph_init(), graph_json_export(), graph_json_import(), graph_json_import_connectivity(), graph_load(), graph_mutate_connectivity(), graph_rand(), graph_save(), and synchronous_update().

evolve_cycles

bool Graph::evolve_cycles

Whether to evolve the number of update cycles.

Definition at line 43 of file dgp.h.

Referenced by graph_copy(), graph_init(), graph_json_import(), graph_load(), graph_mutate(), graph_rand(), and graph_save().

function

int* Graph::function

Node activation functions.

Definition at line 49 of file dgp.h.

Referenced by graph_copy(), graph_free(), graph_init(), graph_json_export(), graph_json_import(), graph_json_import_functions(), graph_load(), graph_mutate_functions(), graph_rand(), graph_save(), and synchronous_update().

initial_state

double* Graph::initial_state

Initial node states.

Definition at line 44 of file dgp.h.

Referenced by graph_copy(), graph_free(), graph_init(), graph_json_export(), graph_json_import(), graph_json_import_initial_state(), graph_load(), graph_rand(), graph_reset(), and graph_save().

klen

int Graph::klen

Length of connectivity map.

Definition at line 50 of file dgp.h.

Referenced by graph_copy(), graph_init(), graph_json_export(), graph_json_import(), graph_json_import_connectivity(), graph_load(), graph_mutate_connectivity(), graph_rand(), and graph_save().

max_k

int Graph::max_k

Maximum number of connections a node may have.

Definition at line 51 of file dgp.h.

Referenced by graph_copy(), graph_init(), graph_json_import(), graph_load(), graph_save(), and synchronous_update().

max_t

int Graph::max_t

Maximum number of update cycles.

Definition at line 52 of file dgp.h.

Referenced by graph_copy(), graph_init(), graph_json_import(), graph_load(), graph_mutate_cycles(), graph_rand(), and graph_save().

mu

double* Graph::mu

Mutation rates.

Definition at line 56 of file dgp.h.

Referenced by graph_copy(), graph_free(), graph_init(), graph_json_export(), graph_json_import(), graph_load(), graph_mutate(), graph_mutate_connectivity(), graph_mutate_cycles(), graph_mutate_functions(), and graph_save().

n

int Graph::n

Number of nodes.

Definition at line 53 of file dgp.h.

Referenced by xcsf.utils.viz.DGPViz::__init__(), cond_dgp_size(), xcsf.utils.viz.DGPViz::draw(), graph_copy(), graph_init(), graph_json_export(), graph_json_import(), graph_json_import_connectivity(), graph_json_import_current_state(), graph_json_import_functions(), graph_json_import_initial_state(), graph_load(), graph_mutate_connectivity(), graph_mutate_functions(), graph_rand(), graph_reset(), graph_save(), rule_dgp_cond_size(), and synchronous_update().

n_inputs

int Graph::n_inputs

Number of inputs to the graph.

Definition at line 54 of file dgp.h.

Referenced by xcsf.utils.viz.DGPViz::__init__(), xcsf.utils.viz.DGPViz::draw(), graph_copy(), graph_init(), graph_json_export(), graph_json_import(), graph_json_import_connectivity(), graph_load(), graph_mutate_connectivity(), graph_rand(), graph_save(), and synchronous_update().

state

double* Graph::state

Current state of each node.

Definition at line 45 of file dgp.h.

Referenced by graph_copy(), graph_free(), graph_init(), graph_json_export(), graph_json_import(), graph_json_import_current_state(), graph_load(), graph_output(), graph_rand(), graph_reset(), graph_save(), and synchronous_update().

t

int Graph::t

Number of cycles to run.

Definition at line 55 of file dgp.h.

Referenced by graph_copy(), graph_init(), graph_json_export(), graph_json_import(), graph_load(), graph_mutate_cycles(), graph_rand(), graph_save(), and graph_update().

tmp_input

double* Graph::tmp_input

Temporary storage for updating the graph.

Definition at line 46 of file dgp.h.

Referenced by graph_free(), graph_init(), graph_json_import(), graph_load(), and synchronous_update().

tmp_state

double* Graph::tmp_state

Temporary storage for synchronous update.

Definition at line 47 of file dgp.h.

Referenced by graph_free(), graph_init(), graph_json_import(), graph_load(), and synchronous_update().

---

The documentation for this struct was generated from the following file:

• dgp.h