#include "search_graph.h"
#include "vw.h"
#include "gd.h"
#include "vw_exception.h"
Go to the source code of this file.
|
#define | IDX(i, j) ((i) * (D.K + 1) + j) |
|
|
bool | GraphTask::example_is_test (polylabel &l) |
|
void | GraphTask::initialize (Search::search &sch, size_t &num_actions, options_i &options) |
|
void | GraphTask::finish (Search::search &sch) |
|
bool | GraphTask::example_is_edge (example *e) |
|
void | GraphTask::run_bfs (task_data &D, multi_ex &ec) |
|
void | GraphTask::setup (Search::search &sch, multi_ex &ec) |
|
void | GraphTask::takedown (Search::search &sch, multi_ex &) |
|
void | GraphTask::add_edge_features_group_fn (task_data &D, float fv, uint64_t fx) |
|
void | GraphTask::add_edge_features_single_fn (task_data &D, float fv, uint64_t fx) |
|
void | GraphTask::add_edge_features (Search::search &sch, task_data &D, size_t n, multi_ex &ec) |
|
void | GraphTask::del_edge_features (task_data &, uint32_t n, multi_ex &ec) |
|
float | GraphTask::macro_f (task_data &D) |
|
void | GraphTask::run (Search::search &sch, multi_ex &ec) |
|
◆ IDX
#define IDX |
( |
|
i, |
|
|
|
j |
|
) |
| ((i) * (D.K + 1) + j) |