Definition at line 56 of file wavegraph.hh.
|
| wavegraph () |
|
| ~wavegraph () |
|
void | add_node (const int nodeidx, const int timeidx, const int freqidx, const int scaleidx, const double value_avg, const double value_stdev, const bool endnode, const nodeids &ancestors) |
|
void | add_node (const wavenode node) |
|
void | clear () |
|
std::vector< cluster > | clustering (const double threshold, const std::vector< WSeries< double > * > &data, const double strip_edges, const int path_halfwidth, const double penal_factor, const std::vector< double > &energy_thresholds) |
|
void | create (const std::string &srcfile) |
|
int | freq (int id) |
|
nodeids | get_ancestors (int id) |
|
wavenode | get_node (int id) |
|
int | get_span () |
|
int | get_stride () |
|
void | heaviest_path (std::vector< double > &total_weight, std::vector< int > &total_length, std::vector< int > &best_ancestor, const std::vector< double > weights) |
|
bool | is_compatible (const std::vector< WSeries< double > * > &data) |
|
int | is_endnode (int id) |
|
bool | is_topologically_sorted () |
|
int | nodeid (int id) |
|
void | print () |
|
int | scale (int id) |
|
int | size () |
|
int | time (int id) |
|
#include <wavegraph.hh>
wavegraph::~wavegraph |
( |
| ) |
|
|
inline |
void wavegraph::add_node |
( |
const int |
nodeidx, |
|
|
const int |
timeidx, |
|
|
const int |
freqidx, |
|
|
const int |
scaleidx, |
|
|
const double |
value_avg, |
|
|
const double |
value_stdev, |
|
|
const bool |
endnode, |
|
|
const nodeids & |
ancestors |
|
) |
| |
void wavegraph::add_node |
( |
const wavenode |
node | ) |
|
void wavegraph::clear |
( |
| ) |
|
|
inline |
std::vector< cluster > wavegraph::clustering |
( |
const double |
threshold, |
|
|
const std::vector< WSeries< double > * > & |
data, |
|
|
const double |
strip_edges, |
|
|
const int |
path_halfwidth, |
|
|
const double |
penal_factor, |
|
|
const std::vector< double > & |
energy_thresholds |
|
) |
| |
void wavegraph::create |
( |
const std::string & |
srcfile | ) |
|
int wavegraph::get_span |
( |
| ) |
|
|
inline |
int wavegraph::get_stride |
( |
| ) |
|
|
inline |
void wavegraph::heaviest_path |
( |
std::vector< double > & |
total_weight, |
|
|
std::vector< int > & |
total_length, |
|
|
std::vector< int > & |
best_ancestor, |
|
|
const std::vector< double > |
weights |
|
) |
| |
bool wavegraph::is_compatible |
( |
const std::vector< WSeries< double > * > & |
data | ) |
|
int wavegraph::is_endnode |
( |
int |
id | ) |
|
|
inline |
bool wavegraph::is_topologically_sorted |
( |
| ) |
|
int wavegraph::nodeid |
( |
int |
id | ) |
|
|
inline |
void wavegraph::print |
( |
| ) |
|
int wavegraph::scale |
( |
int |
id | ) |
|
|
inline |
The documentation for this class was generated from the following files:
- /work/salemi/SOFT/cWB/library/master_0bc430d/tools/wavegraph/wavegraph.hh
- /work/salemi/SOFT/cWB/library/master_0bc430d/tools/wavegraph/wavegraph.cc