Lines Matching refs:centrality

20   brandes_betweenness_centrality(const Graph& g, CentralityMap centrality);
24   brandes_betweenness_centrality(const Graph& g, CentralityMap centrality,
33                                  CentralityMap centrality,
49                                  CentralityMap centrality,
63   central_point_dominance(const Graph& g, CentralityMap centrality);
66 betweenness centrality of the vertices and edges in a graph.  The
67 method of calculating betweenness centrality in *O(V)* space is due to
89 IN: ``CentralityMap centrality`` 
90   A centrality map may be supplied to the algorithm, if not supplied a
91   ``dummy_property_map`` will be used and no vertex centrality
99   An edge centrality map may be supplied to the algorithm, if not
101   centrality information will be recorded.  The ``EdgeCentralityMap``
128   centrality calculation portion of the algorithm.  The
138   is on during the centrality calculation portion of the algorithm.
156   centrality calculation will be unweighted.
161   centrality calculation using all vertices in ``g`` will be
171 contribution to the centrality map is *O(V log V)*.  Calculating exact
172 betweenness centrality requires counting the shortest paths from all
173 vertices in ``g``, thus exact betweenness centrality is *O(V^2 log
202 calculate the dependency and centrality of each vertex.
204 The algorithm is complete when the centrality has been computed from