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

Implementation of Spanning edge centrality with algebraic notation. More...

#include <AlgebraicSpanningEdgeCentrality.h>

Public Member Functions

 AlgebraicSpanningEdgeCentrality (const Graph &graph, double tol=0.1)
 Constructs an instance of the AlgebraicSpanningEdgeCentrality algorithm for the given Graph graph. More...
 
void run () override
 Compute spanning edge centrality exactly. More...
 
void runApproximation ()
 Approximate spanning edge centrality scores with the Johnson-Lindenstrauss transform. More...
 
- Public Member Functions inherited from NetworKit::Centrality
 Centrality (const Graph &G, bool normalized=false, bool computeEdgeCentrality=false)
 Constructs the Centrality class for the given Graph G. More...
 
virtual ~Centrality ()=default
 Default destructor. More...
 
virtual std::vector< double > scores (bool moveOut=false)
 Get a vector containing the centrality score for each node in the graph. More...
 
virtual std::vector< double > edgeScores ()
 Get a vector containing the edge centrality score for each edge in the graph (where applicable). More...
 
virtual std::vector< std::pair
< node, double > > 
ranking ()
 Get a vector of pairs sorted into descending order. More...
 
virtual double score (node v)
 Get the centrality score of node v calculated by run(). More...
 
virtual double maximum ()
 Get the theoretical maximum of centrality score in the given graph. More...
 
virtual double centralization ()
 Compute the centralization of a network with respect to some centrality measure. 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::Centrality
const GraphG
 
std::vector< double > scoreData
 
std::vector< double > edgeScoreData
 
bool normalized
 
bool computeEdgeCentrality
 
- 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<class Matrix>
class NetworKit::AlgebraicSpanningEdgeCentrality< Matrix >

Implementation of Spanning edge centrality with algebraic notation.

Constructor & Destructor Documentation

template<class Matrix >
NetworKit::AlgebraicSpanningEdgeCentrality< Matrix >::AlgebraicSpanningEdgeCentrality ( const Graph graph,
double  tol = 0.1 
)
inline

Constructs an instance of the AlgebraicSpanningEdgeCentrality algorithm for the given Graph graph.

The tolerance tol is used to control the approximation error when approximating the spanning edge centrality for graph.

Parameters
graph
tol

Member Function Documentation

template<class Matrix >
void NetworKit::AlgebraicSpanningEdgeCentrality< Matrix >::run ( )
overridevirtual

Compute spanning edge centrality exactly.

Implements NetworKit::Centrality.

template<class Matrix >
void NetworKit::AlgebraicSpanningEdgeCentrality< Matrix >::runApproximation ( )

Approximate spanning edge centrality scores with the Johnson-Lindenstrauss transform.


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