Searched refs:no_of_conn_pairs (Results 1 – 1 of 1) sorted by relevance
52 igraph_real_t no_of_conn_pairs = 0.0; /* no. of ordered pairs between which there is a path */ in igraph_i_average_path_length_unweighted() local97 no_of_conn_pairs += 1; in igraph_i_average_path_length_unweighted()109 if (no_of_conn_pairs == 0) { in igraph_i_average_path_length_unweighted()112 *res /= no_of_conn_pairs; in igraph_i_average_path_length_unweighted()116 if (no_of_conn_pairs < no_of_pairs && ! invert) { in igraph_i_average_path_length_unweighted()128 *unconnected_pairs = no_of_pairs - no_of_conn_pairs; in igraph_i_average_path_length_unweighted()230 no_of_conn_pairs += 1; in igraph_i_average_path_length_dijkstra()258 if (no_of_conn_pairs == 0) { in igraph_i_average_path_length_dijkstra()261 *res /= no_of_conn_pairs; in igraph_i_average_path_length_dijkstra()265 if (no_of_conn_pairs < no_of_pairs && ! invert) { in igraph_i_average_path_length_dijkstra()[all …]