weight oracle for bipartite graphs with weight function More...
#include <BipartiteFunctionOracle.h>
Public Member Functions | |
BipartiteFunctionOracle (double **dataX, double **dataY, WeightFunction *wf, int r, int c, int d) | |
int | getSize () |
double | computeWeight (int row, int col) |
weight oracle for bipartite graphs with weight function
Special subclass of weight oracles meant for bipartite graphs with weights defined by a function between node descriptors, which are represented such that nodes within each bipartition have negative-infinite weight between each other
BipartiteFunctionOracle::BipartiteFunctionOracle | ( | double ** | dataX, |
double ** | dataY, | ||
WeightFunction * | wf, | ||
int | r, | ||
int | c, | ||
int | d | ||
) |
[in] | dataX | matrix (r x d) whose rows are the vector descriptors of the first bipartition |
[in] | dataY | matrix (c x d) whose rows are the vector descriptors of the second bipartition |
[in] | wf | function mapping node pair descriptors to weight value (e.g., negative Euclidean distance) |
[in] | r | count of rows (number of nodes in first bipartition) |
[in] | c | count of columns (number of nodes in second bipartition) |
[in] | d | dimensionality of vector descriptors |
double BipartiteFunctionOracle::computeWeight | ( | int | row, |
int | col | ||
) | [virtual]
|
Get the weight between nodes
Reimplemented from WeightOracle.
int BipartiteFunctionOracle::getSize | ( | ) | [virtual]
|
returns the number of nodes in the graph
Reimplemented from WeightOracle.