| /dports/math/igraph/igraph-0.9.5/tests/benchmarks/ |
| H A D | igraph_closeness_weighted.c | 18 igraph_vector_t closeness, weight; in main() local
28 igraph_vector_init(&closeness, 0); in main()
40 …REPEAT(igraph_closeness(&graph, &closeness, NULL, NULL, igraph_vss_all(), IGRAPH_OUT, NULL, 1), RE… in main()
43 …REPEAT(igraph_closeness(&graph, &closeness, NULL, NULL, igraph_vss_all(), IGRAPH_ALL, NULL, 1), RE… in main()
49 …REPEAT(igraph_closeness(&graph, &closeness, NULL, NULL, igraph_vss_all(), IGRAPH_OUT, &weight, 1),… in main()
52 …REPEAT(igraph_closeness(&graph, &closeness, NULL, NULL, igraph_vss_all(), IGRAPH_ALL, &weight, 1),… in main()
66 …REPEAT(igraph_closeness(&graph, &closeness, NULL, NULL, igraph_vss_all(), IGRAPH_OUT, NULL, 1), RE… in main()
69 …REPEAT(igraph_closeness(&graph, &closeness, NULL, NULL, igraph_vss_all(), IGRAPH_ALL, NULL, 1), RE… in main()
97 …REPEAT(igraph_closeness(&graph, &closeness, NULL, NULL, igraph_vss_all(), IGRAPH_OUT, NULL, 1), RE… in main()
100 …REPEAT(igraph_closeness(&graph, &closeness, NULL, NULL, igraph_vss_all(), IGRAPH_ALL, NULL, 1), RE… in main()
[all …]
|
| /dports/math/igraph/igraph-0.9.5/tests/unit/ |
| H A D | igraph_closeness.out | 35 Range-limited closeness with cutoff -1
40 Range-limited closeness with cutoff 0
45 Range-limited closeness with cutoff 1
50 Range-limited closeness with cutoff 2.9
55 Range-limited closeness with cutoff 3
60 Range-limited closeness with cutoff 3.1
68 Range-limited directed closeness with cutoff -1
73 Range-limited directed closeness with cutoff 0
78 Range-limited directed closeness with cutoff 1
88 Range-limited directed closeness with cutoff 3
[all …]
|
| H A D | igraph_closeness.c | 203 igraph_vector_init(&closeness, 0); in test_cutoff()
212 print_vector(&closeness); in test_cutoff()
219 igraph_vector_destroy(&closeness); in test_cutoff()
236 igraph_vector_init(&closeness, 0); in test_cutoff_directed()
245 print_vector(&closeness); in test_cutoff_directed()
252 igraph_vector_destroy(&closeness); in test_cutoff_directed()
270 igraph_vector_init(&closeness, 0); in test_cutoff_weighted()
280 print_vector(&closeness); in test_cutoff_weighted()
288 igraph_vector_destroy(&closeness); in test_cutoff_weighted()
302 igraph_vector_init(&closeness, 0); in test_edge_cases()
[all …]
|
| /dports/biology/mothur/mothur-1.46.1/source/datastructures/ |
| H A D | optidata.cpp | 15 for (long long i = 0; i < closeness.size(); i++) { in print()
17 for(set<long long>::iterator it = closeness[i].begin(); it != closeness[i].end(); it++){ in print()
35 …else if (index > closeness.size()) { m->mothurOut("[ERROR]: index is not valid.\n"); m->setControl… in getNumClose()
36 else { return closeness[index].size(); } in getNumClose()
47 …else if (i > closeness.size()) { m->mothurOut("[ERROR]: index is not valid.\n"); m->setControl_pre… in isClose()
50 if (closeness[i].count(toFind) != 0) { found = true; } in isClose()
62 …else if (i > closeness.size()) { m->mothurOut("[ERROR]: index is not valid.\n"); m->setControl_pre… in getCloseSeqs()
64 return closeness[i]; in getCloseSeqs()
79 if (i < closeness.size()) { nameIndexes[thisBinsSeqs[0]] = i; } in getNameIndexMap()
112 …else if (index > closeness.size()) { m->mothurOut("[ERROR]: index is not valid.\n"); m->setControl… in getName()
[all …]
|
| H A D | optirefmatrix.cpp | 378 … for (set<long long>::iterator it = closeness[index].begin(); it != closeness[index].end(); it++) { in getNumFitClose()
399 … for (set<long long>::iterator it = closeness[index].begin(); it != closeness[index].end(); it++) { in getNumRefClose()
420 … for (set<long long>::iterator it = closeness[index].begin(); it != closeness[index].end(); it++) { in getCloseFitSeqs()
441 … for (set<long long>::iterator it = closeness[index].begin(); it != closeness[index].end(); it++) { in getCloseRefSeqs()
569 closeness.resize(nonSingletonCount); in readFiles()
706 closeness.resize(nonSingletonCount); in readFiles()
930 closeness[newA].insert(newB); in readPhylip()
931 closeness[newB].insert(newA); in readPhylip()
1009 closeness[newA].insert(newB); in readColumn()
1010 closeness[newB].insert(newA); in readColumn()
[all …]
|
| H A D | optimatrix.cpp | 14 closeness = close; in OptiMatrix()
109 closeness.resize(nonSingletonCount); in readPhylip()
151 closeness[newA].insert(newB); in readPhylip()
152 closeness[newB].insert(newA); in readPhylip()
178 closeness[newA].insert(newB); in readPhylip()
179 closeness[newB].insert(newA); in readPhylip()
260 closeness.resize(nonSingletonCount); in readColumn()
298 closeness[newA].insert(newB); in readColumn()
299 closeness[newB].insert(newA); in readColumn()
|
| /dports/math/R-cran-igraph/igraph/man/ |
| H A D | closeness.Rd | 3 \name{closeness}
4 \alias{closeness}
5 \alias{closeness.estimate}
9 closeness(
29 \item{vids}{The vertices for which closeness will be calculated.}
43 closeness. Normalization is performed by multiplying the raw closeness by
71 then the function calculates the exact closeness scores.
77 closeness(g)
78 closeness(g2, mode="in")
79 closeness(g2, mode="out")
[all …]
|
| H A D | centr_clo_tmax.Rd | 5 \alias{centralization.closeness.tmax}
6 \title{Theoretical maximum for closeness centralization}
18 \code{closeness}.}
22 closeness centrality score for graphs with given order and other
|
| /dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/bipartite/ |
| H A D | centrality.py | 242 closeness = {}
252 closeness[node] = (m + 2 * (n - 1)) / totsp
255 closeness[node] *= s
257 closeness[n] = 0.0
262 closeness[node] = (n + 2 * (m - 1)) / totsp
265 closeness[node] *= s
267 closeness[n] = 0.0
268 return closeness
|
| /dports/graphics/netpbm/netpbm-10.91.01/editor/ |
| H A D | ppmchange.c | 36 float closeness; member
65 &cmdlineP->closeness, &closenessSpec, 0); in parseCommandLine()
82 cmdlineP->closeness = 0.0; in parseCommandLine()
84 if (cmdlineP->closeness < 0.0) in parseCommandLine()
85 pm_error("-closeness value %f is negative", cmdlineP->closeness); in parseCommandLine()
87 if (cmdlineP->closeness > 100) in parseCommandLine()
89 cmdlineP->closeness); in parseCommandLine()
225 allowableDiff = ROUNDU(sqrt3 * maxval * cmdline.closeness/100); in main()
|
| /dports/graphics/R-cran-DiagrammeR/DiagrammeR/man/ |
| H A D | get_closeness_vitality.Rd | 5 \title{Get closeness vitality}
13 A data frame with closeness vitality values for each of the nodes.
16 Get the closeness vitality values for all nodes in the graph.
28 # Get closeness vitality values
32 # Add the closeness vitality
|
| H A D | get_closeness.Rd | 5 \title{Get closeness centrality values}
18 A data frame with closeness values for each of the nodes.
21 Get the closeness centrality values for all nodes in a graph.
33 # Get closeness values for all nodes
37 # Add the closeness values to
|
| H A D | set_cache.Rd | 38 # Get the closeness values for
46 col = "closeness"
54 # and closeness values for nodes in
63 get_closeness(.)$closeness
|
| /dports/graphics/R-cran-DiagrammeR/DiagrammeR/R/ |
| H A D | get_closeness.R | 68 igraph::closeness(ig_graph, mode = "all")
73 igraph::closeness(ig_graph, mode = "out")
78 igraph::closeness(ig_graph, mode = "in")
86 closeness = closeness_values, nameattr
|
| /dports/graphics/netpbm/netpbm-10.91.01/test/ |
| H A D | pnmcrop2.test | 47 for closeness in `seq 0 6`
49 echo ${closeness}
50 pnmcrop -reportfull -bg-corner=topleft -closeness=${closeness} ${test_pgm} \
|
| H A D | pnmcrop1.ok | 100 -bg-color=black -closeness=-1
101 Expected failure: -bg-color=black -closeness=-1 1
102 -bg-color=black -closeness=101
103 Expected failure: -bg-color=black -closeness=101 1
|
| /dports/converters/wkhtmltopdf/qt-5db36ec/util/gencmap/ |
| H A D | gencmap.cpp | 318 int closeness=INT_MAX; in main() local
322 if (d < closeness) { in main()
323 closeness=d; in main()
327 if (closeness > dist) { in main()
329 dist=closeness; in main()
|
| /dports/astro/oskar/OSKAR-2.8.0/oskar/telescope/station/element/src/ |
| H A D | oskar_element_load_scalar.c | 26 double closeness, double closeness_inc, const char* name,
31 double closeness, double closeness_inc, int ignore_at_poles, in oskar_element_load_scalar() argument
159 closeness, closeness_inc, "Scalar [real]", log, status); in oskar_element_load_scalar()
161 closeness, closeness_inc, "Scalar [imag]", log, status); in oskar_element_load_scalar()
178 double closeness, double closeness_inc, const char* name, in fit_splines() argument
183 avg_frac_error = closeness; /* Copy the fitting parameter. */ in fit_splines()
|
| H A D | oskar_element_load_cst.c | 25 double closeness, double closeness_inc, const char* name,
30 double closeness, double closeness_inc, int ignore_at_poles, in oskar_element_load_cst() argument
235 closeness, closeness_inc, "H [real]", log, status); in oskar_element_load_cst()
237 closeness, closeness_inc, "H [imag]", log, status); in oskar_element_load_cst()
239 closeness, closeness_inc, "V [real]", log, status); in oskar_element_load_cst()
241 closeness, closeness_inc, "V [imag]", log, status); in oskar_element_load_cst()
285 double closeness, double closeness_inc, const char* name, in fit_splines() argument
296 avg_frac_error = closeness; /* Copy the fitting parameter. */ in fit_splines()
|
| /dports/databases/grass7/grass-7.8.6/lib/vector/neta/ |
| H A D | centrality.c | 127 double *closeness) in NetA_betweenness_closeness() argument
152 if (closeness) in NetA_betweenness_closeness()
153 closeness[i] = 0; in NetA_betweenness_closeness()
222 if (closeness) in NetA_betweenness_closeness()
223 closeness[s] += dst[w]; in NetA_betweenness_closeness()
234 if (closeness) in NetA_betweenness_closeness()
235 closeness[s] /= (double)stack_size; in NetA_betweenness_closeness()
|
| /dports/databases/grass7/grass-7.8.6/vector/v.net.centrality/ |
| H A D | main.c | 29 double *deg, *closeness, *betw, *eigen; variable
60 append_double(&sql, closeness[node]); in process_node()
289 deg = closeness = betw = eigen = NULL; in main()
302 closeness = (double *)G_calloc(nnodes + 1, sizeof(double)); in main()
303 if (!closeness) in main()
326 NetA_betweenness_closeness(graph, betw, closeness); in main()
327 if (closeness) in main()
329 closeness[i] /= (double)In.dgraph.cost_multip; in main()
385 if (closeness) in main()
386 G_free(closeness); in main()
|
| /dports/math/R-cran-influenceR/influenceR/src/ |
| H A D | bridging.c | 52 double bridging_vertex_precomp(graph_t *G, long v, double cls, double *closeness);
54 double closeness(graph_t *G, long ignore_edge0, long ignore_edge1);
86 double c = closeness(G, j, k); in bridging()
93 double cls = closeness(G, -1, -1); // normal closeness (use all edges) in bridging()
152 buf[i] = closeness(G, j, k); in bridging_MPI()
203 double cls = closeness(G, -1, -1); // normal closeness (use all edges) in bridging_MPI()
221 double bridging_vertex_precomp(graph_t *G, long v, double cls, double *closeness) { in bridging_vertex_precomp() argument
227 double cls_ = closeness[j]; in bridging_vertex_precomp()
240 double closeness(graph_t *G, long ignore_edge0, long ignore_edge1) in closeness() function
|
| /dports/games/scorched3d/scorched/src/common/placement/ |
| H A D | PlacementType.cpp | 107 fixed closeness = mincloseness + target->getBorder(); in checkCloseness() local
109 if (closeness > 0) in checkCloseness()
111 if (distx.abs() < closeness && in checkCloseness()
112 disty.abs() < closeness) in checkCloseness()
|
| /dports/games/xshisen/xshisen-1.51/ |
| H A D | mahjong.C | 18 Mahjong::ReadFile(Widget w, char *filename, int num, int closeness) in ReadFile() argument
38 attributes.closeness = closeness; in ReadFile()
58 closeness); in ReadFile()
|
| /dports/graphics/R-cran-DiagrammeR/DiagrammeR/tests/testthat/ |
| H A D | test-cache_attrs.R | 32 closeness_df$closeness,
53 closeness_vec <- closeness_df$closeness
83 closeness_df$closeness,
|