summaryrefslogtreecommitdiff
path: root/src
diff options
context:
space:
mode:
Diffstat (limited to 'src')
-rw-r--r--src/correlations.c1
-rw-r--r--src/graph_create.c2
2 files changed, 0 insertions, 3 deletions
diff --git a/src/correlations.c b/src/correlations.c
index 98106dd..f403ab8 100644
--- a/src/correlations.c
+++ b/src/correlations.c
@@ -243,7 +243,6 @@ uint_t **get_dists(const graph_t *network) {
uint_t nv = network->dnv;
uint_t **dists = (uint_t **)malloc(nv * sizeof(uint_t *));
- #pragma omp parallel for
for (uint_t i = 0; i < nv; i++) {
dists[i] = dijkstra(network, i);
}
diff --git a/src/graph_create.c b/src/graph_create.c
index 874a85c..fdb1bf6 100644
--- a/src/graph_create.c
+++ b/src/graph_create.c
@@ -23,7 +23,6 @@ double *get_edge_coords(uint_t num_edges, double *vert_coords,
uint_t *edges_to_verts) {
double *output = (double *)malloc(2 * num_edges * sizeof(double));
- #pragma omp parallel for
for (uint_t i = 0; i < num_edges; i++) {
uint_t v1, v2;
double v1x, v1y, v2x, v2y, dx, dy;
@@ -273,7 +272,6 @@ uint_t *get_voro_dual_edges(uint_t num_edges,
uint_t *dual_edges =
(uint_t *)malloc(2 * num_edges * sizeof(uint_t));
uint_t place = 0;
- #pragma omp parallel for
for (uint_t i = 0; i < num_edges; i++) {
uint_t v1, v2;
v1 = edges[2 * i];