All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Public Member Functions | Protected Attributes | List of all members
NetworKit::SimmelianScore Class Reference

Abstract base class for the two variants of Simmelian backbones (OverlapFilter, JaccardFilter). More...

#include <SimmelianScore.h>

Public Member Functions

 SimmelianScore (const Graph &graph, const std::vector< count > &attribute)
 
virtual double score (edgeid eid) override
 Get the edge score of the edge with the given edge id. More...
 
virtual double score (node u, node v) override
 Get the edge score of the given edge. More...
 
std::vector< RankedNeighborsgetRankedNeighborhood (const Graph &g, const std::vector< count > &triangles)
 
Redundancy getOverlap (const node &ego, const node &alter, const std::vector< RankedNeighbors > &neighbors, const count &maxRank)
 
void matchNeighbors (const node &ego, const node &alter, const bool &reciprocityCheck, std::vector< RankedEdge >::const_iterator &egoIt, const RankedNeighbors &egoNeighbors, std::set< node > &egoNeighborsUnmatched, std::set< node > &alterNeighborsUnmatched, const count &rank, count &overlap)
 Helper function used in getOverlap. More...
 
- Public Member Functions inherited from NetworKit::EdgeScore< double >
 EdgeScore (const Graph &G)
 
virtual void run ()
 Compute the edge score. More...
 
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
 

Protected Attributes

const std::vector< count > & triangles
 
- 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

Abstract base class for the two variants of Simmelian backbones (OverlapFilter, JaccardFilter).

Constructor & Destructor Documentation

NetworKit::SimmelianScore::SimmelianScore ( const Graph graph,
const std::vector< count > &  attribute 
)

Member Function Documentation

Redundancy NetworKit::SimmelianScore::getOverlap ( const node ego,
const node alter,
const std::vector< RankedNeighbors > &  neighbors,
const count maxRank 
)
std::vector< RankedNeighbors > NetworKit::SimmelianScore::getRankedNeighborhood ( const Graph g,
const std::vector< count > &  triangles 
)
void NetworKit::SimmelianScore::matchNeighbors ( const node ego,
const node alter,
const bool &  reciprocityCheck,
std::vector< RankedEdge >::const_iterator &  egoIt,
const RankedNeighbors egoNeighbors,
std::set< node > &  egoNeighborsUnmatched,
std::set< node > &  alterNeighborsUnmatched,
const count rank,
count overlap 
)

Helper function used in getOverlap.

Adds the intersection of egoNeighbors and alterNeighborsUnmatched to overlap.

double NetworKit::SimmelianScore::score ( edgeid  eid)
overridevirtual

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

Reimplemented from NetworKit::EdgeScore< double >.

double NetworKit::SimmelianScore::score ( node  u,
node  v 
)
overridevirtual

Get the edge score of the given edge.

Reimplemented from NetworKit::EdgeScore< double >.

Member Data Documentation

const std::vector<count>& NetworKit::SimmelianScore::triangles
protected

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