All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Public Member Functions | List of all members
NetworKit::LocalFilterScore< InType > Class Template Reference

Local filtering edge scoring. More...

#include <LocalFilterScore.h>

Public Member Functions

 LocalFilterScore (const Graph &G, const std::vector< InType > &attribute, bool logarithmic=true)
 Initialize the local edge filtering score. More...
 
virtual void run ()
 Execute the algorithm. More...
 
virtual double score (node u, node v)
 Get the edge score of the given edge. More...
 
virtual double score (edgeid eid)
 Get the edge score of the edge with the given edge id. More...
 
- Public Member Functions inherited from NetworKit::EdgeScore< double >
 EdgeScore (const Graph &G)
 
virtual std::vector< double > scores () const
 Get a vector containing the score for each edge in the graph. More...
 
- Public Member Functions inherited from NetworKit::Algorithm
 Algorithm ()
 Constructor to the algorithm base class. More...
 
virtual ~Algorithm ()=default
 Virtual default destructor. More...
 
bool hasFinished () const
 Indicates whether an algorithm has completed computation or not. More...
 
void assureFinished () const
 Assure that the algorithm has been run, throws a std::runtime_error otherwise. More...
 
virtual std::string toString () const
 Returns a string with the algorithm's name and its parameters, if there are any. More...
 
virtual bool isParallel () const
 

Additional Inherited Members

- Protected Attributes inherited from NetworKit::EdgeScore< double >
const GraphG
 
std::vector< double > scoreData
 
- Protected Attributes inherited from NetworKit::Algorithm
bool hasRun
 A boolean variable indicating whether an algorithm has finished its computation or not. More...
 

Detailed Description

template<typename InType>
class NetworKit::LocalFilterScore< InType >

Local filtering edge scoring.

Edges with high score are more important.

Edges are ranked locally, the top d^e (logarithmic, default) or 1+e*(d-1) edges (non-logarithmic) are kept. For equal attribute values, neighbors of low degree are preferred.

Constructor & Destructor Documentation

template<typename InType >
NetworKit::LocalFilterScore< InType >::LocalFilterScore ( const Graph G,
const std::vector< InType > &  attribute,
bool  logarithmic = true 
)
inline

Initialize the local edge filtering score.

Parameters
GThe graph for which the score shall be.
attributeThe input attribute according to which the edges shall be fitlered locally.
logarithmicIf the score shall be logarithmic in the rank (then d^e edges are kept). Linear otherwise.

Member Function Documentation

template<typename InType >
virtual void NetworKit::LocalFilterScore< InType >::run ( )
inlinevirtual

Execute the algorithm.

Reimplemented from NetworKit::EdgeScore< double >.

template<typename InType >
virtual double NetworKit::LocalFilterScore< InType >::score ( node  u,
node  v 
)
inlinevirtual

Get the edge score of the given edge.

Reimplemented from NetworKit::EdgeScore< double >.

template<typename InType >
virtual double NetworKit::LocalFilterScore< InType >::score ( edgeid  eid)
inlinevirtual

Get the edge score of the edge with the given edge id.

Reimplemented from NetworKit::EdgeScore< double >.


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