| /dports/devel/boost-docs/boost_1_72_0/libs/graph/test/ |
| H A D | betweenness_centrality_test.cpp | 62 std::vector<double> centrality(V); in run_weighted_test() local
111 std::vector<double> centrality(V); in run_unweighted_test() local
199 std::vector<double> centrality(V); in run_wheel_test() local
275 put(centrality, *vi, 0); in simple_unweighted_betweenness_centrality()
368 put(centrality, *v, get(centrality, *v) / centrality_type(2)); in simple_unweighted_betweenness_centrality()
392 std::vector<double> centrality(n); in random_unweighted_test() local
405 if (!std::equal(centrality.begin(), centrality.end(), in random_unweighted_test()
409 centrality[v] == 0.0? centrality2[v] in random_unweighted_test()
410 : (centrality2[v] - centrality[v]) / centrality[v]; in random_unweighted_test()
430 if (!std::equal(centrality.begin(), centrality.end(), in random_unweighted_test()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/graph/test/ |
| H A D | betweenness_centrality_test.cpp | 62 std::vector<double> centrality(V); in run_weighted_test() local
111 std::vector<double> centrality(V); in run_unweighted_test() local
199 std::vector<double> centrality(V); in run_wheel_test() local
275 put(centrality, *vi, 0); in simple_unweighted_betweenness_centrality()
368 put(centrality, *v, get(centrality, *v) / centrality_type(2)); in simple_unweighted_betweenness_centrality()
392 std::vector<double> centrality(n); in random_unweighted_test() local
405 if (!std::equal(centrality.begin(), centrality.end(), in random_unweighted_test()
409 centrality[v] == 0.0? centrality2[v] in random_unweighted_test()
410 : (centrality2[v] - centrality[v]) / centrality[v]; in random_unweighted_test()
430 if (!std::equal(centrality.begin(), centrality.end(), in random_unweighted_test()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/test/ |
| H A D | betweenness_centrality_test.cpp | 62 std::vector<double> centrality(V); in run_weighted_test() local
111 std::vector<double> centrality(V); in run_unweighted_test() local
199 std::vector<double> centrality(V); in run_wheel_test() local
277 put(centrality, *vi, 0); in simple_unweighted_betweenness_centrality()
370 put(centrality, *v, get(centrality, *v) / centrality_type(2)); in simple_unweighted_betweenness_centrality()
394 std::vector<double> centrality(n); in random_unweighted_test() local
407 if (!std::equal(centrality.begin(), centrality.end(), in random_unweighted_test()
411 centrality[v] == 0.0? centrality2[v] in random_unweighted_test()
412 : (centrality2[v] - centrality[v]) / centrality[v]; in random_unweighted_test()
432 if (!std::equal(centrality.begin(), centrality.end(), in random_unweighted_test()
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/test/ |
| H A D | betweenness_centrality_test.cpp | 62 std::vector<double> centrality(V); in run_weighted_test() local
111 std::vector<double> centrality(V); in run_unweighted_test() local
199 std::vector<double> centrality(V); in run_wheel_test() local
277 put(centrality, *vi, 0); in simple_unweighted_betweenness_centrality()
370 put(centrality, *v, get(centrality, *v) / centrality_type(2)); in simple_unweighted_betweenness_centrality()
394 std::vector<double> centrality(n); in random_unweighted_test() local
407 if (!std::equal(centrality.begin(), centrality.end(), in random_unweighted_test()
411 centrality[v] == 0.0? centrality2[v] in random_unweighted_test()
412 : (centrality2[v] - centrality[v]) / centrality[v]; in random_unweighted_test()
432 if (!std::equal(centrality.begin(), centrality.end(), in random_unweighted_test()
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/libs/graph/test/ |
| H A D | betweenness_centrality_test.cpp | 62 std::vector<double> centrality(V); in run_weighted_test() local
111 std::vector<double> centrality(V); in run_unweighted_test() local
199 std::vector<double> centrality(V); in run_wheel_test() local
277 put(centrality, *vi, 0); in simple_unweighted_betweenness_centrality()
370 put(centrality, *v, get(centrality, *v) / centrality_type(2)); in simple_unweighted_betweenness_centrality()
394 std::vector<double> centrality(n); in random_unweighted_test() local
407 if (!std::equal(centrality.begin(), centrality.end(), in random_unweighted_test()
411 centrality[v] == 0.0? centrality2[v] in random_unweighted_test()
412 : (centrality2[v] - centrality[v]) / centrality[v]; in random_unweighted_test()
432 if (!std::equal(centrality.begin(), centrality.end(), in random_unweighted_test()
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/graph/test/ |
| H A D | betweenness_centrality_test.cpp | 62 std::vector<double> centrality(V); in run_weighted_test() local
111 std::vector<double> centrality(V); in run_unweighted_test() local
199 std::vector<double> centrality(V); in run_wheel_test() local
277 put(centrality, *vi, 0); in simple_unweighted_betweenness_centrality()
370 put(centrality, *v, get(centrality, *v) / centrality_type(2)); in simple_unweighted_betweenness_centrality()
394 std::vector<double> centrality(n); in random_unweighted_test() local
407 if (!std::equal(centrality.begin(), centrality.end(), in random_unweighted_test()
411 centrality[v] == 0.0? centrality2[v] in random_unweighted_test()
412 : (centrality2[v] - centrality[v]) / centrality[v]; in random_unweighted_test()
432 if (!std::equal(centrality.begin(), centrality.end(), in random_unweighted_test()
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/libs/graph/test/ |
| H A D | betweenness_centrality_test.cpp | 62 std::vector<double> centrality(V); in run_weighted_test() local
111 std::vector<double> centrality(V); in run_unweighted_test() local
199 std::vector<double> centrality(V); in run_wheel_test() local
277 put(centrality, *vi, 0); in simple_unweighted_betweenness_centrality()
370 put(centrality, *v, get(centrality, *v) / centrality_type(2)); in simple_unweighted_betweenness_centrality()
394 std::vector<double> centrality(n); in random_unweighted_test() local
407 if (!std::equal(centrality.begin(), centrality.end(), in random_unweighted_test()
411 centrality[v] == 0.0? centrality2[v] in random_unweighted_test()
412 : (centrality2[v] - centrality[v]) / centrality[v]; in random_unweighted_test()
432 if (!std::equal(centrality.begin(), centrality.end(), in random_unweighted_test()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/libs/graph/test/ |
| H A D | betweenness_centrality_test.cpp | 62 std::vector<double> centrality(V); in run_weighted_test() local
111 std::vector<double> centrality(V); in run_unweighted_test() local
199 std::vector<double> centrality(V); in run_wheel_test() local
275 put(centrality, *vi, 0); in simple_unweighted_betweenness_centrality()
368 put(centrality, *v, get(centrality, *v) / centrality_type(2)); in simple_unweighted_betweenness_centrality()
392 std::vector<double> centrality(n); in random_unweighted_test() local
405 if (!std::equal(centrality.begin(), centrality.end(), in random_unweighted_test()
409 centrality[v] == 0.0? centrality2[v] in random_unweighted_test()
410 : (centrality2[v] - centrality[v]) / centrality[v]; in random_unweighted_test()
430 if (!std::equal(centrality.begin(), centrality.end(), in random_unweighted_test()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/libs/graph/test/ |
| H A D | betweenness_centrality_test.cpp | 64 std::vector< double > centrality(V); in run_weighted_test() local
113 std::vector< double > centrality(V); in run_unweighted_test() local
143 ? centrality[v] in run_unweighted_test()
201 std::vector< double > centrality(V); in run_wheel_test() local
225 (v == 0 && centrality[v] == 1) || (v != 0 && centrality[v] == 0)); in run_wheel_test()
280 put(centrality, *vi, 0); in simple_unweighted_betweenness_centrality()
386 put(centrality, *v, get(centrality, *v) / centrality_type(2)); in simple_unweighted_betweenness_centrality()
424 if (!std::equal(centrality.begin(), centrality.end(), centrality2.begin())) in random_unweighted_test()
430 : (centrality2[v] - centrality[v]) / centrality[v]; in random_unweighted_test()
450 if (!std::equal(centrality.begin(), centrality.end(), centrality3.begin())) in random_unweighted_test()
[all …]
|
| /dports/biology/lamarc/lamarc-2.1.8/boost/graph/ |
| H A D | betweenness_centrality.hpp | 302 init_centrality_map(vertices(g), centrality); in brandes_betweenness_centrality_impl()
344 update_centrality(centrality, w, get(dependency, w)); in brandes_betweenness_centrality_impl()
353 divide_centrality_by_two(vertices(g), centrality); in brandes_betweenness_centrality_impl()
438 g, centrality, edge_centrality_map, in brandes_betweenness_centrality_dispatch2()
474 g, centrality, edge_centrality_map, in brandes_betweenness_centrality_dispatch2()
488 run(const Graph& g, CentralityMap centrality, in run()
503 run(const Graph& g, CentralityMap centrality, in run()
537 g, centrality, dummy_property_map(), get(vertex_index, g)); in brandes_betweenness_centrality()
546 g, centrality, edge_centrality_map, get(vertex_index, g)); in brandes_betweenness_centrality()
566 put(centrality, *v, factor * get(centrality, *v)); in relative_betweenness_centrality()
[all …]
|
| /dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/centrality/ |
| H A D | degree_alg.py | 40 centrality = {n: d * s for n, d in G.degree()}
41 return centrality
83 centrality = {n: d * s for n, d in G.in_degree()}
84 return centrality
126 centrality = {n: d * s for n, d in G.out_degree()}
127 return centrality
|
| /dports/graphics/R-cran-DiagrammeR/DiagrammeR/man/ |
| H A D | get_leverage_centrality.Rd | 5 \title{Get leverage centrality}
13 A data frame with leverage centrality values for each of the nodes.
16 Get the leverage centrality values for all nodes in the graph. Leverage
17 centrality is a measure of the relationship between the degree of a given
19 node with negative leverage centrality is influenced by its neighbors, as the
21 leverage centrality influences its neighbors since the neighbors tend to have
35 # Get leverage centrality values
40 # Add the leverage centrality
|
| /dports/devel/boost-docs/boost_1_72_0/libs/graph_parallel/doc/ |
| H A D | non_distributed_betweenness_centrality.rst | 69 central_point_dominance(const Graph& g, CentralityMap centrality);
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
101 IN: ``CentralityMap centrality``
102 A centrality map may be supplied to the algorithm, if one is not
104 centrality information will be recorded. The key type of the
112 centrality information will be recorded. The key type of the
162 centrality calculation will be unweighted.
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/graph_parallel/doc/ |
| H A D | non_distributed_betweenness_centrality.rst | 69 central_point_dominance(const Graph& g, CentralityMap centrality);
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
101 IN: ``CentralityMap centrality``
102 A centrality map may be supplied to the algorithm, if one is not
104 centrality information will be recorded. The key type of the
112 centrality information will be recorded. The key type of the
162 centrality calculation will be unweighted.
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph_parallel/doc/ |
| H A D | non_distributed_betweenness_centrality.rst | 69 central_point_dominance(const Graph& g, CentralityMap centrality);
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
101 IN: ``CentralityMap centrality``
102 A centrality map may be supplied to the algorithm, if one is not
104 centrality information will be recorded. The key type of the
112 centrality information will be recorded. The key type of the
162 centrality calculation will be unweighted.
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/libs/graph_parallel/doc/ |
| H A D | non_distributed_betweenness_centrality.rst | 69 central_point_dominance(const Graph& g, CentralityMap centrality);
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
101 IN: ``CentralityMap centrality``
102 A centrality map may be supplied to the algorithm, if one is not
104 centrality information will be recorded. The key type of the
112 centrality information will be recorded. The key type of the
162 centrality calculation will be unweighted.
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/graph_parallel/doc/ |
| H A D | non_distributed_betweenness_centrality.rst | 69 central_point_dominance(const Graph& g, CentralityMap centrality);
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
101 IN: ``CentralityMap centrality``
102 A centrality map may be supplied to the algorithm, if one is not
104 centrality information will be recorded. The key type of the
112 centrality information will be recorded. The key type of the
162 centrality calculation will be unweighted.
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/libs/graph_parallel/doc/ |
| H A D | non_distributed_betweenness_centrality.rst | 69 central_point_dominance(const Graph& g, CentralityMap centrality);
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
101 IN: ``CentralityMap centrality``
102 A centrality map may be supplied to the algorithm, if one is not
104 centrality information will be recorded. The key type of the
112 centrality information will be recorded. The key type of the
162 centrality calculation will be unweighted.
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/libs/graph_parallel/doc/ |
| H A D | non_distributed_betweenness_centrality.rst | 69 central_point_dominance(const Graph& g, CentralityMap centrality);
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
101 IN: ``CentralityMap centrality``
102 A centrality map may be supplied to the algorithm, if one is not
104 centrality information will be recorded. The key type of the
112 centrality information will be recorded. The key type of the
162 centrality calculation will be unweighted.
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph_parallel/doc/ |
| H A D | non_distributed_betweenness_centrality.rst | 69 central_point_dominance(const Graph& g, CentralityMap centrality);
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
101 IN: ``CentralityMap centrality``
102 A centrality map may be supplied to the algorithm, if one is not
104 centrality information will be recorded. The key type of the
112 centrality information will be recorded. The key type of the
162 centrality calculation will be unweighted.
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/libs/graph_parallel/doc/ |
| H A D | non_distributed_betweenness_centrality.rst | 69 central_point_dominance(const Graph& g, CentralityMap centrality);
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
101 IN: ``CentralityMap centrality``
102 A centrality map may be supplied to the algorithm, if one is not
104 centrality information will be recorded. The key type of the
112 centrality information will be recorded. The key type of the
162 centrality calculation will be unweighted.
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
| H A D | betweenness_centrality.hpp | 302 init_centrality_map(vertices(g), centrality); in brandes_betweenness_centrality_impl()
344 update_centrality(centrality, w, get(dependency, w)); in brandes_betweenness_centrality_impl()
353 divide_centrality_by_two(vertices(g), centrality); in brandes_betweenness_centrality_impl()
439 g, centrality, edge_centrality_map, in brandes_betweenness_centrality_dispatch2()
474 g, centrality, edge_centrality_map, in brandes_betweenness_centrality_dispatch2()
488 run(const Graph& g, CentralityMap centrality, in run()
503 run(const Graph& g, CentralityMap centrality, in run()
552 g, centrality, dummy_property_map(), get(vertex_index, g)); in brandes_betweenness_centrality()
562 g, centrality, edge_centrality_map, get(vertex_index, g)); in brandes_betweenness_centrality()
582 put(centrality, *v, factor * get(centrality, *v)); in relative_betweenness_centrality()
[all …]
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
| H A 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()
389 divide_centrality_by_two(vertices(g), centrality); in brandes_betweenness_centrality_impl()
401 CentralityMap centrality, // C_B in brandes_betweenness_centrality() argument
421 CentralityMap centrality, // C_B in brandes_betweenness_centrality() argument
572 CentralityMap centrality BOOST_GRAPH_ENABLE_IF_MODELS_PARM( in brandes_betweenness_centrality()
576 g, centrality, dummy_property_map(), get(vertex_index, g)); in brandes_betweenness_centrality()
585 g, centrality, edge_centrality_map, get(vertex_index, g)); in brandes_betweenness_centrality()
607 put(centrality, *v, factor * get(centrality, *v)); in relative_betweenness_centrality()
615 CentralityMap centrality BOOST_GRAPH_ENABLE_IF_MODELS_PARM( in central_point_dominance()
[all …]
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/ |
| H A D | betweenness_centrality.hpp | 303 init_centrality_map(vertices(g), centrality); in brandes_betweenness_centrality_impl()
345 update_centrality(centrality, w, get(dependency, w)); in brandes_betweenness_centrality_impl()
354 divide_centrality_by_two(vertices(g), centrality); in brandes_betweenness_centrality_impl()
441 g, centrality, edge_centrality_map, in brandes_betweenness_centrality_dispatch2()
477 g, centrality, edge_centrality_map, in brandes_betweenness_centrality_dispatch2()
491 run(const Graph& g, CentralityMap centrality, in run()
506 run(const Graph& g, CentralityMap centrality, in run()
555 g, centrality, dummy_property_map(), get(vertex_index, g)); in brandes_betweenness_centrality()
565 g, centrality, edge_centrality_map, get(vertex_index, g)); in brandes_betweenness_centrality()
585 put(centrality, *v, factor * get(centrality, *v)); in relative_betweenness_centrality()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/ |
| H A D | betweenness_centrality.hpp | 302 init_centrality_map(vertices(g), centrality); in brandes_betweenness_centrality_impl()
344 update_centrality(centrality, w, get(dependency, w)); in brandes_betweenness_centrality_impl()
353 divide_centrality_by_two(vertices(g), centrality); in brandes_betweenness_centrality_impl()
439 g, centrality, edge_centrality_map, in brandes_betweenness_centrality_dispatch2()
474 g, centrality, edge_centrality_map, in brandes_betweenness_centrality_dispatch2()
488 run(const Graph& g, CentralityMap centrality, in run()
503 run(const Graph& g, CentralityMap centrality, in run()
552 g, centrality, dummy_property_map(), get(vertex_index, g)); in brandes_betweenness_centrality()
562 g, centrality, edge_centrality_map, get(vertex_index, g)); in brandes_betweenness_centrality()
582 put(centrality, *v, factor * get(centrality, *v)); in relative_betweenness_centrality()
[all …]
|