[GRASS-SVN] r41818 - grass/branches/develbranch_6/vector/v.net.centrality

svn_grass at osgeo.org svn_grass at osgeo.org
Mon Apr 12 09:52:54 EDT 2010


Author: martinl
Date: 2010-04-12 09:52:53 -0400 (Mon, 12 Apr 2010)
New Revision: 41818

Modified:
   grass/branches/develbranch_6/vector/v.net.centrality/main.c
Log:
v.net.centarality: variable renamed due to compilation problems on MS Windows

Modified: grass/branches/develbranch_6/vector/v.net.centrality/main.c
===================================================================
--- grass/branches/develbranch_6/vector/v.net.centrality/main.c	2010-04-12 06:55:07 UTC (rev 41817)
+++ grass/branches/develbranch_6/vector/v.net.centrality/main.c	2010-04-12 13:52:53 UTC (rev 41818)
@@ -26,7 +26,7 @@
 
 /*Global variables */
 struct Option *deg_opt, *close_opt, *betw_opt, *eigen_opt;
-double *deg, *close, *betw, *eigen;
+double *deg, *closeness, *betw, *eigen;
 
 /* Attribute table */
 dbString sql, tmp;
@@ -57,7 +57,7 @@
     if (deg_opt->answer)
 	append_double(&sql, deg[node]);
     if (close_opt->answer)
-	append_double(&sql, close[node]);
+	append_double(&sql, closeness[node]);
     if (betw_opt->answer)
 	append_double(&sql, betw[node]);
     if (eigen_opt->answer)
@@ -258,7 +258,7 @@
     graph = &(In.graph);
     nnodes = dglGet_NodeCount(graph);
 
-    deg = close = betw = eigen = NULL;
+    deg = closeness = betw = eigen = NULL;
 
     covered = (char *)G_calloc(nnodes + 1, sizeof(char));
     if (!covered)
@@ -271,8 +271,8 @@
     }
 
     if (close_opt->answer) {
-	close = (double *)G_calloc(nnodes + 1, sizeof(double));
-	if (!close)
+	closeness = (double *)G_calloc(nnodes + 1, sizeof(double));
+	if (!closeness)
 	    G_fatal_error(_("Out of memory"));
     }
 
@@ -295,10 +295,10 @@
     }
     if (betw_opt->answer || close_opt->answer) {
 	G_message(_("Computing betweenness and/or closeness centrality measure"));
-	NetA_betweenness_closeness(graph, betw, close);
-	if (close)
+	NetA_betweenness_closeness(graph, betw, closeness);
+	if (closeness)
 	    for (i = 1; i <= nnodes; i++)
-		close[i] /= (double)In.cost_multip;
+		closeness[i] /= (double)In.cost_multip;
     }
     if (eigen_opt->answer) {
 	G_message(_("Computing eigenvector centrality measure"));
@@ -352,8 +352,8 @@
     G_free(covered);
     if (deg)
 	G_free(deg);
-    if (close)
-	G_free(close);
+    if (closeness)
+	G_free(closeness);
     if (betw)
 	G_free(betw);
     if (eigen)



More information about the grass-commit mailing list