all_distance_sketch::TSkimReverseRank< Z > Class Template Reference

Infuelnce maximization based on reverse ranks. More...

#include <t_skim_reverse_rank.h>

Inherits all_distance_sketch::TSkimBase< Z >.

Public Member Functions
void	InitTSkim (int T, int K_all_distance_sketch, int min_influence_for_seed, Cover *cover, graph::Graph< Z > *graph)
	Initialize the class. More...
void	set_graph_sketch (GraphSketch *graph_sketch)
	Sets the graph sketch and prevents the algorithm from performing the calculation Calculating the graph sketch may be expensive specially if you want to play with different value of T.
int	Run ()

Detailed Description

template<class Z>
class all_distance_sketch::TSkimReverseRank< Z >

Infuelnce maximization based on reverse ranks.

Examples:

examples/t_skim.cpp.

Member Function Documentation

template<class Z>

void all_distance_sketch::TSkimReverseRank< Z >::InitTSkim ( int  T, int  K_all_distance_sketch, int  min_influence_for_seed, Cover *  cover, graph::Graph< Z > *  graph  )

inline

Initialize the class.

Parameters

[in]	T	- The influence of each node, e.g. if T=100 then each nodes has influence over all nodes that rank him among their top 100
[in]	K_all_distance_sketch	- The first step of the algorithm is to calculate the graph sketch. This parameter detetmines the accuracy of the influence.
[out]	cover	- The result cover
[in]	graph	- The graph to conduct the influence maximization on

See also

GraphSketch

Examples:

examples/t_skim.cpp.

---

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

• src/algorithms/t_skim_reverse_rank.h