|
|
void | InitTSkim (int T, int K_all_distance_sketch, int min_influence_for_seed, std::vector< std::vector< int >> *reverse_refernce, Cover *cover, graph::Graph< Z > *graph) |
| |
|
void | set_graph_sketch (GraphSketch *graph_sketch) |
| |
|
int | AddSeed (int seed, std::unordered_map< int, int > *influence_change) |
| |
|
const std::vector< int > & | CalculateVisitedNodes (int source_node_id) |
| |
|
int | Run () |
| |
|
void | InitTSkimBase (int T, int min_influence_for_seed, Cover *cover, graph::Graph< Z > *graph) |
| |
|
void | set_rankers_nodes (const std::vector< int > &rankers_nodes) |
| |
|
void | set_rankees_nodes (const std::vector< int > &rankees_nodes) |
| |
|
void | set_wanted_cover_nodes (const std::vector< int > &wanted_cover_nodes) |
| |
|
void | CalculateRankeeNodes () |
| |
|
void | CalculateRankerNodes () |
| |
|
void | CalculateWantedNodes () |
| |
|
void | CalculateRandomNodePermutation (std::vector< int > *nodes) |
| |
|
void | ExtractNodesFromGraph (std::unordered_map< int, bool > *candidates) |
| |
|
void | ExtractNodesFromGraph (std::vector< int > *candidates) |
| |
|
void | PreRunInit () |
| |
|
int | UpdateCover (int seed, std::unordered_map< int, int > *influence_change, const std::vector< int > &covered_nodes) |
| |
|
virtual void | UpdateInfluceAndSeedSet (int source_node, int visited_node, std::vector< int > *seed_set) |
| |
|
int | Run (bool ShouldRunPreRunInit=true) |
| |
|
|
int | T_ |
| |
|
int | min_influence_for_seed_ |
| |
|
Cover * | cover_ |
| |
|
graph::Graph< Z > * | graph_ |
| |
|
std::vector< int > | rankers_nodes_ |
| |
|
std::unordered_map< int, bool > | rankees_nodes_ |
| |
|
std::unordered_map< int, bool > | wanted_nodes_ |
| |
|
std::unordered_map< int, int > | node_influence_ |
| |
|
std::unordered_map< int, std::vector< int > > | reachable_nodes_ |
| |
The documentation for this class was generated from the following file:
Public Member Functions inherited from all_distance_sketch::TSkimBase< Z >
1.8.9
