}
}
} else {
- initLayout(graph, n, dim, d_coords, nodes);
+ initLayout(n, dim, d_coords, nodes);
if (compute_hierarchy(graph, n, abs_tol, relative_tol, NULL, &ordering,
&levels, &num_levels)) {
iterations = -1;
float maxEdgeLen = 0;
double max = 1;
- initLayout(graph, n, dim, d_coords, nodes);
+ initLayout(n, dim, d_coords, nodes);
if (n == 1)
return 0;
* a position, use it.
* Return true if some node is fixed.
*/
-int
-initLayout(vtx_data * graph, int n, int dim, double **coords,
- node_t ** nodes)
-{
+int initLayout(int n, int dim, double **coords, node_t **nodes) {
node_t *np;
double *xp;
double *yp;
orthog1(n, d_coords[i]);
}
} else {
- havePinned = initLayout(graph, n, dim, d_coords, nodes);
+ havePinned = initLayout(n, dim, d_coords, nodes);
}
if (Verbose)
fprintf(stderr, ": %.2f sec", elapsed_sec());
extern float *compute_apsp_artifical_weights_packed(vtx_data * graph, int n);
extern float* circuitModel(vtx_data * graph, int nG);
extern float* mdsModel (vtx_data * graph, int nG);
-extern int initLayout(vtx_data * graph, int n, int dim, double **coords, node_t** nodes);
+extern int initLayout(int n, int dim, double **coords, node_t **nodes);
#ifdef __cplusplus
}