Defined in File SpanningEdgeCentrality.hpp
public NetworKit::Centrality
(Class Centrality)
SpanningEdgeCentrality edge centrality.
Public Functions
Constructs the SpanningEdgeCentrality class for the given Graph G.
G – The graph.
tol – constant used for the approximation: with probability at least 1-1/n, the approximated scores are within a factor 1+tol from the exact scores
Destructor.
Compute spanning edge centrality scores exactly for all edges. This solves a linear system for each edge, so the empirical running time is O(m^2), where m is the number of edges in the graph.
Compute approximation by JL projection. This solves k linear systems, where k is log(n)/(tol^2). The empirical running time is O(km), where n is the number of nodes and m is the number of edges.
Compute approximation by JL projection in parallel. This solves k linear systems in parallel, where k is log(n)/(tol^2).
This method is deprecated and will not be supported in future releases. Use runApproximation() instead.
directory –
Elapsed time in milliseconds.
The elapsed time to setup the solver in milliseconds.