-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathGraph_Save.h
More file actions
94 lines (70 loc) · 2.16 KB
/
Copy pathGraph_Save.h
File metadata and controls
94 lines (70 loc) · 2.16 KB
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
//读图的信息进行读取
//函数声明
void Graph_Write(MGraph *G);
MGraph Graph_Read(MGraph G);
void Graph_Write(MGraph *G)
{
int i,j;
FILE *fp;
fp = fopen("Graph.txt","w");
if(!fp)
{
printf("系统拒绝分配内存\n");
return;
}
fprintf(fp,"%d %d %d\n",G->vexnum,G->arcnum,G->kind);
for(i = 0;i < G->vexnum; i++)
{
fprintf(fp,"%s %d\n",G->vexs[i].name,G->vexs[i].Buses_Num);
for(j = 0; j < G->vexs[i].Buses_Num; j++)
fprintf(fp,"%d ",G->vexs[i].Buses[j]);
fprintf(fp,"\n");
}
for(i = 0; i < G->vexnum; i++)
for(j = 0; j < G->vexnum; j++)
{
if(INT_MAX == G->arcs[i][j].adj)
fprintf(fp,"0 ");
else
fprintf(fp,"%d ",G->arcs[i][j].adj);
if(j == G->vexnum - 1)
fprintf(fp,"\n");
}
fclose(fp);
// printf("\n Graph_Write \n");
}
MGraph Graph_Read(MGraph G)
{
int i,j,n;
FILE *fp;
fp = fopen("Graph.txt","r");
if(!fp)
{
printf("系统拒绝分配内存\n");
exit(1);
}
fscanf(fp,"%d %d %d\n",&G.vexnum,&G.arcnum,&G.kind);
for(i = 0;i < G.vexnum; i++)
{
fscanf(fp,"%s %d\n",G.vexs[i].name,&G.vexs[i].Buses_Num);
G.vexs[i].Buses = (int *)malloc(G.vexs[i].Buses_Num*sizeof(int));
if(!G.vexs[i].Buses)
{
printf("error");
// return;
}
for(j = 0; j < G.vexs[i].Buses_Num; j++)
fscanf(fp,"%d ",&G.vexs[i].Buses[j]);
fscanf(fp,"\n");
}
for(i = 0; i < G.vexnum; i++)
for(j = 0; j < G.vexnum; j++)
{
fscanf(fp,"%d",&G.arcs[i][j].adj);
if(j == G.vexnum - 1)
fscanf(fp,"\n");
}
fclose(fp);
// printf("\n Graph_Read \n");
return G;
}