Searched refs:unconn_pairs (Results 1 – 6 of 6) sorted by relevance
| /dports/math/igraph/igraph-0.9.5/tests/unit/ |
| H A D | igraph_average_path_length.c | 25 igraph_real_t res, unconn_pairs; in print_and_destroy() local
27 igraph_average_path_length(graph, &res, &unconn_pairs, IGRAPH_DIRECTED, unconn); in print_and_destroy()
30 printf("\nNo. of unconnected pairs: %g\n", unconn_pairs); in print_and_destroy()
|
| H A D | igraph_average_path_length_dijkstra.c | 24 igraph_real_t unconn_pairs; in compute_and_print() local
26 IGRAPH_ASSERT(igraph_average_path_length_dijkstra(graph, &result, &unconn_pairs, weights, in compute_and_print()
32 print_real(stdout, unconn_pairs, "%8g"); in compute_and_print()
|
| /dports/math/igraph/igraph-0.9.5/include/ |
| H A D | igraph_paths.h | 127 igraph_real_t *res, igraph_real_t *unconn_pairs,
130 … igraph_real_t *res, igraph_real_t *unconn_pairs,
|
| /dports/math/igraph/igraph-0.9.5/src/paths/ |
| H A D | shortest_paths.c | 316 igraph_real_t *res, igraph_real_t *unconn_pairs, in igraph_average_path_length() argument
319 …return igraph_i_average_path_length_unweighted(graph, res, unconn_pairs, directed, /* invert= */ 0… in igraph_average_path_length()
368 igraph_real_t *res, igraph_real_t *unconn_pairs, in igraph_average_path_length_dijkstra() argument
372 …return igraph_i_average_path_length_dijkstra(graph, res, unconn_pairs, weights, directed, /* inver… in igraph_average_path_length_dijkstra()
|
| /dports/math/igraph/igraph-0.9.5/ |
| H A D | CHANGELOG.md | 219 …th()` now returns the number of disconnected vertex pairs in the new `unconn_pairs` output argumen…
|
| /dports/math/igraph/igraph-0.9.5/interfaces/ |
| H A D | functions.yaml | 508 PARAMS: GRAPH graph, OUT REALPTR res, OUT REALPTR unconn_pairs=NULL, BOOLEAN directed=True,
|