27 inline double distance_kD(
double **coords,
int dim,
int i,
int j) {
30 for (
int k = 0; k < dim; k++) {
32 (coords[k][i] - coords[k][j]) * (coords[k][i] -
40 void quicksort_place(
double *place,
int *ordering,
int first,
int last);
41 void free_graph(
vtx_data * (&graph));
50 extern double distance_kD(
double **,
int,
int,
int);
DistType ** compute_apsp_artifical_weights(vtx_data *graph, int n)
void restore_old_weights(vtx_data *graph, int n, float *old_weights)
int common_neighbors(vtx_data *graph, int v, int u, int *v_vector)
void fill_neighbors_vec_unweighted(vtx_data *graph, int vtx, int *vtx_vec)
DistType ** compute_apsp(vtx_data *graph, int n)
double distance_kD(double **coords, int dim, int i, int j)
void quicksort_place(double *place, int *ordering, int first, int last)
void empty_neighbors_vec(vtx_data *graph, int vtx, int *vtx_vec)
Agraph_t * graph(char *name)
void compute_new_weights(vtx_data *graph, int n)
void quicksort_placef(float *place, int *ordering, int first, int last)