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

Dynamic betweenness of a single node. More...

#include <DynBetweennessOneNode.h>

Public Member Functions

 DynBetweennessOneNode (Graph &G, node x)
 Creates the object for G. More...
 
void run ()
 initialize distances and Pred by repeatedly running the Dijkstra2 algorithm More...
 
void update (GraphEvent event) override
 Updates the betweenness centrality of x after an edge insertions on the graph. More...
 
void updateBatch (const std::vector< GraphEvent > &batch) override
 Updates the betweenness centrality of x after a batch of edge insertions on the graph. More...
 
edgeweight computeScore (GraphEvent event)
 Returns the new betweenness score of node x after the insertion of an edge. More...
 
edgeweight getDistance (node u, node v)
 
edgeweight getSigma (node u, node v)
 
edgeweight getSigmax (node u, node v)
 
edgeweight getbcx ()
 
- Public Member Functions inherited from NetworKit::DynAlgorithm
virtual ~DynAlgorithm ()=default
 Virtual default destructor. More...
 

Detailed Description

Dynamic betweenness of a single node.

Constructor & Destructor Documentation

NetworKit::DynBetweennessOneNode::DynBetweennessOneNode ( Graph G,
node  x 
)

Creates the object for G.

Parameters
GThe graph. x The node for which we want to compute betweenness.

Member Function Documentation

edgeweight NetworKit::DynBetweennessOneNode::computeScore ( GraphEvent  event)

Returns the new betweenness score of node x after the insertion of an edge.

Distances and scores of the other nodes are not changed by this function.

edgeweight NetworKit::DynBetweennessOneNode::getbcx ( )
edgeweight NetworKit::DynBetweennessOneNode::getDistance ( node  u,
node  v 
)
edgeweight NetworKit::DynBetweennessOneNode::getSigma ( node  u,
node  v 
)
edgeweight NetworKit::DynBetweennessOneNode::getSigmax ( node  u,
node  v 
)
void NetworKit::DynBetweennessOneNode::run ( )

initialize distances and Pred by repeatedly running the Dijkstra2 algorithm

Run method that stores a One shortest path for each node pair and stores shortest distances.

void NetworKit::DynBetweennessOneNode::update ( GraphEvent  event)
overridevirtual

Updates the betweenness centrality of x after an edge insertions on the graph.

Notice: it works only with edge insertions.

Parameters
eThe edge insertions.

Implements NetworKit::DynAlgorithm.

void NetworKit::DynBetweennessOneNode::updateBatch ( const std::vector< GraphEvent > &  batch)
overridevirtual

Updates the betweenness centrality of x after a batch of edge insertions on the graph.

Notice: it works only with edge insertions.

Parameters
batchThe batch of edge insertions.

Implements NetworKit::DynAlgorithm.


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