1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
|
#include <stdio.h>
#if !(defined __MSC__) && !(defined __ABSC__) && !(defined __MINGW32__)
#if defined(netbsd) || defined(freebsd)
#include <sys/types.h>
#endif
#include <dirent.h>
#endif
#include <string.h>
#ifdef __STDC__
#include <stdlib.h>
#else
#include <malloc.h>
#endif
#ifdef WIN32
#include <stdlib.h> /*qsort*/
#include <direct.h> /*_getcwd _chdir*/
#endif
#if (defined __MSC__) || (defined __MINGW32__)
/** only used for x=dir[1024] **/
#include <io.h>
#define getwd(x) _getcwd(x,1024)
#define chdir(x) _chdir(x)
#endif
#if defined(netbsd) || defined(freebsd)
#include <unistd.h>
#endif
#include "../machine.h"
#ifdef WIN32
#include "../os_specific/win_mem_alloc.h" /* MALLOC */
#else
#include "../os_specific/sci_mem_alloc.h" /* MALLOC */
#endif
#define MAXNAM 80
extern double atof();
extern char* my_basename();
extern void cerro();
extern char* dirname();
extern int CheckGraphName();
extern char *StripGraph();
typedef int (*PF)();
static int CompString(s1, s2)
char **s1, **s2;
{
return strcmp((char*)*s1,(char*)*s2);
}
void C2F(saveg)(path,lpath,name,lname,directed,node_number,tail,head,
node_name,node_type,node_x,node_y,node_color,node_diam,node_border,
node_font_size,node_demand,
edge_name,edge_color,edge_width,edge_hi_width,edge_font_size,
edge_length,edge_cost,edge_min_cap,edge_max_cap,edge_q_weight,edge_q_orig,
edge_weight,
default_node_diam,default_node_border,default_edge_width,
default_edge_hi_width,default_font_size,ma)
char *path; int *lpath;
char *name; int *lname,*directed,*node_number,*tail,*head;
char ***node_name;
int *node_type,*node_x,*node_y,*node_color,*node_diam,*node_border;
int *node_font_size;
double *node_demand;
char ***edge_name;
int *edge_color,*edge_width,*edge_hi_width,*edge_font_size;
double *edge_length,*edge_cost,*edge_min_cap,*edge_max_cap;
double *edge_q_weight,*edge_q_orig,*edge_weight;
int *default_node_diam,*default_node_border,*default_edge_width;
int *default_edge_hi_width,*default_font_size;
int *ma;
{
FILE *f;
#if !(defined __MSC__) &&! (defined __MINGW32__)
DIR *dirp;
#else
int it;
#endif
char fname[2*MAXNAM];
char description[2*MAXNAM];
char dir[1024], nname[2*MAXNAM];
int i;
char **lar;
/* check uniqueness of node names */
if (*node_number != 1) {
if ((lar = (char **)MALLOC(sizeof(char *) * *node_number)) == NULL) {
cerro("Running out of memory");
return;
}
for (i = 0; i < *node_number; i++) lar[i] = (*node_name)[i];
qsort((char*)lar,*node_number,sizeof(char*),(PF)CompString);
for (i = 0; i < *node_number - 1; i++) {
if (!strcmp(lar[i],lar[i+1])) {
sprintf(description,
"Bad graph file. Node \"%s\" is duplicated",lar[i]);
cerro(description);
FREE(lar);
return;
}
}
if (!strcmp(lar[*node_number - 2],lar[*node_number - 1])) {
sprintf(description,
"Bad graph file. Node \"%s\" is duplicated",lar[*node_number - 2]);
cerro(description);
FREE(lar);
return;
}
FREE(lar);
}
path[*lpath] = '\0';
name[*lname] = '\0';
if (!strcmp(path," ")) {
getwd(dir);
strcpy(nname,name);
}
else {
#if (defined __MSC__) || (defined __MINGW32__)
getwd(dir);
#if (defined __MSC__) || (defined __MINGW32__)
it= chdir(path);
chdir(dir);
#else
it= chdir_(path,strlen(path));
chdir_(dir,strlen(dir));
#endif
if (it == 0) {
strcpy(dir,path);
}
#else
if ((dirp=opendir(path)) != NULL) {
strcpy(dir,path);
closedir(dirp);
}
#endif
else {
strcpy(nname,StripGraph(my_basename(path)));
if (dirname(path) == NULL) getwd(dir);
else strcpy(dir,dirname(path));
}
}
#if !(defined __MSC__) && ! (defined __MINGW32__)
if ((dirp=opendir(dir)) == NULL) {
sprintf(description,"Directory \"%s\" does not exist",dir);
cerro(description);
return;
}
closedir(dirp);
/* if(CheckGraphName(nname,dir)) {
sprintf(description,"Graph \"%s\" already exists in directory \"%s\"",
nname,dir);
cerro(description);
return;
}*/
#endif
strcpy(fname,dir);
strcat(fname,"/");
strcat(fname,nname);
strcat(fname,".graph");
f = fopen(fname,"w");
if (f == NULL) {
sprintf(description,
"Unable to write file in directory %s, check access",dir);
cerro(description);
return;
}
/* Write graph to file */
fprintf(f,"GRAPH TYPE (0 = UNDIRECTED, 1 = DIRECTED), DEFAULTS (NODE DIAMETER, NODE BORDER, ARC WIDTH, HILITED ARC WIDTH, FONTSIZE):\n");
fprintf(f,"%d %d %d %d %d %d\n",*directed,*default_node_diam,
*default_node_border,*default_edge_width,*default_edge_hi_width,
*default_font_size);
if (*directed) {
fprintf(f,"NUMBER OF ARCS:\n");
}
else {
fprintf(f,"NUMBER OF EDGES:\n");
}
fprintf(f,"%d\n",*ma);
fprintf(f,"NUMBER OF NODES:\n");
fprintf(f,"%d\n",*node_number);
fprintf(f,"****************************************\n");
/* Write arcs to files */
if (*directed) {
fprintf(f,"DESCRIPTION OF ARCS:\n");
fprintf(f,"ARC NAME, TAIL NODE NAME, HEAD NODE NAME, COLOR, WIDTH, HIWIDTH, FONTSIZE\n");
}
else {
fprintf(f,"DESCRIPTION OF EDGES:\n");
fprintf(f,"EDGE NAME, NODE NAME, NODE NAME, COLOR, WIDTH, HIWIDTH, FONTSIZE\n");
}
fprintf
(f,"COST, MIN CAP, MAX CAP, LENGTH, Q WEIGHT, Q ORIGIN, WEIGHT\n");
fprintf(f,"\n");
for (i = 0; i < *ma; i++) {
fprintf(f,"%s %s %s %d %d %d %d\n",(*edge_name)[i],(*node_name)[tail[i]-1],
(*node_name)[head[i]-1],edge_color[i],edge_width[i],
edge_hi_width[i],edge_font_size[i]);
fprintf(f,"%e %e %e %e %e %e %e\n",
edge_cost[i],edge_min_cap[i],edge_max_cap[i],edge_length[i],
edge_q_weight[i],edge_q_orig[i],edge_weight[i]);
}
/* Write nodes to files */
fprintf(f,"****************************************\n");
fprintf(f,"DESCRIPTION OF NODES:\n");
fprintf(f,"NODE NAME, POSSIBLE TYPE (1 = SINK, 2 = SOURCE)\n");
fprintf(f,"X, Y, COLOR, DIAMETER, BORDER, FONTSIZE\n");
fprintf(f,"DEMAND\n");
fprintf(f,"\n");
for (i = 0; i < *node_number; i++) {
if (node_type[i] == 0)
fprintf(f,"%s\n",(*node_name)[i]);
else fprintf(f,"%s %d\n",(*node_name)[i],node_type[i]);
fprintf(f,"%d %d %d %d %d %d \n",
node_x[i],node_y[i],node_color[i],node_diam[i],
node_border[i],node_font_size[i]);
fprintf(f,"%e\n",node_demand[i]);
}
fclose(f);
}
|
