From: Jonathan Zheng <jonathanzheng@hotmail.co.uk>
Date: Fri, 17 Jan 2020 11:09:25 +0000 (+0000)
Subject: fixed indentation
X-Git-Tag: stable_release_2.44.0~12^2~6
X-Git-Url: https://granicus.if.org/sourcecode?a=commitdiff_plain;h=ece132e8fc1863d57c7e5ed83eb7e768a93d1651;p=graphviz

fixed indentation
---

diff --git a/lib/neatogen/sgd.c b/lib/neatogen/sgd.c
index e71ccb24c..67c9ce01e 100644
--- a/lib/neatogen/sgd.c
+++ b/lib/neatogen/sgd.c
@@ -90,19 +90,19 @@ graph_sgd * extract_adjacency(graph_t *G, int model) {
         bool *neighbours_i = N_NEW(graph->n, bool);
         bool *neighbours_j = N_NEW(graph->n, bool);
         for (i=0; i<graph->n; i++) {
-			// initialise to no neighbours
+            // initialise to no neighbours
             neighbours_i[i] = false;
-			neighbours_j[i] = false;
+            neighbours_j[i] = false;
         }
         for (i=0; i<graph->n; i++) {
             int x;
-			int deg_i = 0;
+            int deg_i = 0;
             for (x=graph->sources[i]; x<graph->sources[i+1]; x++) {
                 int j = graph->targets[x];
-				if (neighbours_i[j] == false) { // ignore multiedges
-					neighbours_i[j] = true; // set up sort of hashset
-					deg_i++;
-				}
+                if (neighbours_i[j] == false) { // ignore multiedges
+                    neighbours_i[j] = true; // set up sort of hashset
+                    deg_i++;
+                }
             }
             for (x=graph->sources[i]; x<graph->sources[i+1]; x++) {
                 int j = graph->targets[x];
@@ -111,18 +111,18 @@ graph_sgd * extract_adjacency(graph_t *G, int model) {
                 for (y=graph->sources[j]; y<graph->sources[j+1]; y++) {
                     int k = graph->targets[y];
                     if (neighbours_j[k] == false) { // ignore multiedges
-						neighbours_j[k] = true; // set up sort of hashset
-						deg_j++;
-						if (neighbours_i[k]) {
-							intersect++;
-						}
+                        neighbours_j[k] = true; // set up sort of hashset
+                        deg_j++;
+                        if (neighbours_i[k]) {
+                            intersect++;
+                        }
                     }
                 }
                 graph->weights[x] = deg_i + deg_j - (2*intersect);
                 assert(graph->weights[x] > 0);
                 for (y=graph->sources[j]; y<graph->sources[j+1]; y++) {
                     int k = graph->targets[y];
-					neighbours_j[k] = false; // reset sort of hashset
+                    neighbours_j[k] = false; // reset sort of hashset
                 }
             }
             for (x=graph->sources[i]; x<graph->sources[i+1]; x++) {