| /third_party/boost/libs/graph/test/ |
| D | betweenness_centrality_test.cpp | 64 std::vector< double > centrality(V); in run_weighted_test() local
67 centrality.begin(), get(vertex_index, g), double())) in run_weighted_test()
73 BOOST_TEST(centrality[v] == correct_centrality[v]); in run_weighted_test()
113 std::vector< double > centrality(V); in run_unweighted_test() local
118 centrality.begin(), get(vertex_index, g), double())) in run_unweighted_test()
140 BOOST_TEST(centrality[v] == centrality2[v]); in run_unweighted_test()
143 ? centrality[v] in run_unweighted_test()
144 : (centrality[v] - correct_centrality[v]) / correct_centrality[v]; in run_unweighted_test()
201 std::vector< double > centrality(V); in run_wheel_test() local
204 centrality.begin(), get(vertex_index, g), double())); in run_wheel_test()
[all …]
|
| D | csr_graph_test.cpp | 391 double centrality; member
396 Edge(double weight) : weight(weight), centrality(0.0) {} in Edge()
399 double centrality; member
411 double centrality[5] = { 0.0, 1.5, 0.0, 1.0, 0.5 }; in test_vertex_and_edge_properties() local
416 centrality_map(get(&Vertex::centrality, g)) in test_vertex_and_edge_properties()
418 .edge_centrality_map(get(&Edge::centrality, g))); in test_vertex_and_edge_properties()
421 BOOST_TEST(g[v].centrality == centrality[v]); in test_vertex_and_edge_properties()
|
| /third_party/boost/libs/graph_parallel/doc/ |
| D | non_distributed_betweenness_centrality.rst | 22 CentralityMap centrality, Buffer sources);
28 CentralityMap centrality,
40 CentralityMap centrality,
56 CentralityMap centrality,
69 central_point_dominance(const Graph& g, CentralityMap centrality);
72 betweenness centrality of the vertices and edges in a graph. The name
76 betweenness centrality, this variant of the algorithm performs the
80 process accumulates into it's local centrality map and once all the
82 combine the centrality from all the processes.
95 betweenness centrality communicate. The process group type must
[all …]
|
| D | betweenness_centrality.rst | 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
[all …]
|
| D | index.rst | 95 - `Betweenness centrality`_
96 - `Non-distributed betweenness centrality`_
159 .. _Betweenness centrality: betweenness_centrality.html
160 .. _Non-distributed betweenness centrality: non_distributed_betweenness_centrality.html
|
| /third_party/boost/boost/graph/ |
| D | betweenness_centrality.hpp | 315 CentralityMap centrality, // C_B in brandes_betweenness_centrality_impl() argument
329 init_centrality_map(vertices(g), centrality); in brandes_betweenness_centrality_impl()
378 update_centrality(centrality, w, get(dependency, w)); in brandes_betweenness_centrality_impl()
389 divide_centrality_by_two(vertices(g), centrality); in brandes_betweenness_centrality_impl()
401 CentralityMap centrality, // C_B in brandes_betweenness_centrality() argument
412 detail::graph::brandes_betweenness_centrality_impl(g, centrality, in brandes_betweenness_centrality()
421 CentralityMap centrality, // C_B in brandes_betweenness_centrality() argument
434 detail::graph::brandes_betweenness_centrality_impl(g, centrality, in brandes_betweenness_centrality()
447 CentralityMap centrality, EdgeCentralityMap edge_centrality_map, in brandes_betweenness_centrality_dispatch2() argument
468 brandes_betweenness_centrality(g, centrality, edge_centrality_map, in brandes_betweenness_centrality_dispatch2()
[all …]
|
| D | properties.hpp | 106 BOOST_DEF_PROPERTY(vertex, centrality);
115 BOOST_DEF_PROPERTY(edge, centrality);
|
| /third_party/boost/boost/graph/distributed/ |
| D | betweenness_centrality.hpp | 697 CentralityMap centrality, in do_brandes_sssp() argument
941 update_centrality(centrality, w, get(dependency, w)); in do_brandes_sssp()
956 CentralityMap centrality, in brandes_betweenness_centrality_impl() argument
976 init_centrality_map(vertices(g), centrality); in brandes_betweenness_centrality_impl()
1004 do_brandes_sssp(g, centrality, edge_centrality_map, incoming, distance, in brandes_betweenness_centrality_impl()
1020 do_brandes_sssp(g, centrality, edge_centrality_map, incoming, distance, in brandes_betweenness_centrality_impl()
1033 divide_centrality_by_two(vertices(g), centrality); in brandes_betweenness_centrality_impl()
1044 CentralityMap centrality, in do_sequential_brandes_sssp() argument
1096 update_centrality(centrality, w, get(dependency, w)); in do_sequential_brandes_sssp()
1113 CentralityMap centrality, in non_distributed_brandes_betweenness_centrality_impl() argument
[all …]
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_betweenness_centrality_test.cpp | 165 CentralityMap centrality(centralityS.begin(), get(vertex_index, g)); in test_main() local
167 brandes_betweenness_centrality(g, centrality); in test_main()
179 int g_cpd = central_point_dominance(g, centrality); in test_main()
249 if (get(centrality, *v) != seqCentralityS[(n/p) * get(owner, *v) + get(local, *v)]) { in test_main()
251 << " does not match the sequential result (" << get(centrality, *v) << " vs. " in test_main()
|
| D | ssca.cpp | 518 extract_max_bc_vertices(const ProcessGroup& pg, const Graph& g, const CentralityMap& centrality, in extract_max_bc_vertices() argument
533 if (get(centrality, v) == max_) in extract_max_bc_vertices()
535 else if (get(centrality, v) > max_) { in extract_max_bc_vertices()
536 max_ = get(centrality, v); in extract_max_bc_vertices()
991 CentralityMap centrality(centralityS.begin(), get(vertex_index, g)); in run_distributed_graph_tests() local
1008 brandes_betweenness_centrality(fg, centrality); in run_distributed_graph_tests()
1009 extract_max_bc_vertices(pg, g, centrality, max_bc_vec); in run_distributed_graph_tests()
1114 if (get(centrality, v) != seq_centralityS[(n/p) * get(owner, v) + get(local, v)]) { in run_distributed_graph_tests()
1116 << " does not match the sequential result (" << get(centrality, v) << " vs. " in run_distributed_graph_tests()
|
| D | distributed_csr_algorithm_test.cpp | 325 CentralityMap centrality(centralityS.begin(), get(vertex_index, g)); in test_main() local
327 brandes_betweenness_centrality(g, centrality); in test_main()
|
| D | algorithm_performance.cpp | 203 CentralityMap centrality(centralityS.begin(), get(vertex_index, g)); in test_directed_csr_only_algorithms() local
245 centrality_map(centrality).lookahead((m / n) * (C / 2))); in test_directed_csr_only_algorithms()
|
| /third_party/boost/libs/math/doc/distributions/ |
| D | nc_chi_squared.qbk | 26 // Accessor to non centrality parameter lambda:
76 and non-centrality parameter /lambda/.
104 This function returns the non centrality parameter /lambda/ such that:
112 this function returns the non centrality parameter /lambda/ such that:
182 For small values of the non centrality parameter, the CDF is computed
192 For larger values of the non-centrality parameter, Ding's method can take
197 Therefore, when the non-centrality parameter is greater than 200, the method due
238 non-centrality parameter the relation in terms of __cyl_bessel_i
240 non-centrality parameter, so in that case the infinite sum is
|
| D | nc_f.qbk | 27 // Accessor to non-centrality parameter lambda:
39 random variable with /v1/ degrees of freedom and non-centrality parameter [lambda],
61 and non-centrality parameter /lambda/.
75 Returns the non-centrality parameter /lambda/ from which this object was constructed.
100 is the non-centrality parameter,
|
| D | nc_t.qbk | 26 // Accessor to non-centrality parameter delta:
57 parameter /v/ and non-centrality parameter /delta/.
67 Returns the non-centrality parameter /delta/ from which this object was constructed.
|
| D | nc_beta.qbk | 27 // Accessor to non-centrality parameter lambda:
65 and non-centrality parameter /lambda/.
|
| /third_party/boost/libs/math/doc/overview/ |
| D | credits.qbk | 96 for large non-centrality and/or large degrees of freedom.
|
| D | roadmap.qbk | 157 * Fix behaviour of the non-central chi-squared distribution when the non-centrality parameter is ze…
317 * Much enhanced accuracy for large degrees of freedom [nu] and/or large non-centrality [delta]
|
| /third_party/boost/libs/math/test/ |
| D | nct.ipp | 216 // depends upon the square of the non-centrality parameter, so these both take
|
| /third_party/boost/libs/math/reporting/accuracy/doc/ |
| D | accuracy_tables.qbk | 2387 [[Non Central T (small non-centrality)][[GNU_C_version_7_1_0_linux_double_non_central_t_CDF_complem…
2396 [[Non Central T (small non-centrality)][[GNU_C_version_7_1_0_linux_double_non_central_t_CDF_boost_N…
|