28 extern double distance_kD(
double **,
int,
int,
int);
Agraph_t * graph(char *name)
void quicksort_place(double *, int *, int)
DistType ** compute_apsp(vtx_data *, int)
void compute_new_weights(vtx_data *graph, int n)
void quicksort_placef(float *, int *, int, int)
void fill_neighbors_vec_unweighted(vtx_data *, int vtx, int *vtx_vec)
DistType ** compute_apsp_artificial_weights(vtx_data *, int)
void restore_old_weights(vtx_data *graph, int n, float *old_weights)
void empty_neighbors_vec(vtx_data *graph, int vtx, int *vtx_vec)
double distance_kD(double **, int, int, int)
size_t common_neighbors(vtx_data *, int u, int *)