-
Notifications
You must be signed in to change notification settings - Fork 0
/
li_6.2.1.c
171 lines (161 loc) · 3.09 KB
/
li_6.2.1.c
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
#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>
#define Max 1000
int stack[Max];
int top = -1;
void push(int v)
{
if(top >= Max)
{
printf("%d stack full\n",stack[Max-1]);
exit(0);
}
else
{
top ++;
stack[top] = v;
}
}
int pop(void){
int temp;
if(top < 0)
{
printf("stack empty\n");
return -1;
}
temp = stack[top];
top --;
return temp;
}
int f_dsf(int va,int vb,float *Lin,int *P,int e,int size)
{
int i,j,k;
int *ins;
int yes;
ins = (int *)malloc(size * sizeof(int));
for(i = 0; i< size;i ++)
{
*(ins + i) = 0;
}
*(ins + vb) = 1;//此节点已遍历过
push(vb);
k = vb;
while(top!=-1)
{
yes = 0;
for(i = 0;i < e;i ++ )
{
if(((int)*(Lin + i*3 +0)==k||(int)*(Lin + i*3 +1)==k)&&*(P + i)==1)
{
for(j =0;j<2;j++ )
if((int)*(Lin + i*3 +j)!=k)//指向点
{
if(*(ins + (int)*(Lin + i*3 +j) ) != 1)//未被遍历
{
push((int)*(Lin + i*3 +j));
*(ins + (int)*(Lin + i*3 +j)) = 1;//标记
k =*(Lin + i*3 +j);
yes = 1;
break;
}
}
}
}
if(yes != 1)///没找到下一个满足点
{
k = pop();
}
if(k == va)//如果找到了则两个在同一树中
{
top = -1;//清零
free(ins);
return 0;
}
}
top = -1;//清零
free(ins);
return 1;
}
void SelectionSort(float *Lin,int e)
{
int i = 0;
int min = 0;
int j = 0;
int tmp = 0;
for(i = 0;i < e-1;i++)
{
min = i;//每次min置成无序组起始位置元素下标
for(j = i;j < e;j++)//遍历无序组,找到最小元素。
{
if(*(Lin + min*3 + 2)>*(Lin+j*3 + 2))
{
min = j;
}
}
if(min != i)//如果最小元素不是无序组起始位置元素,则与起始元素交换位置
{
tmp = *(Lin + min *3 + 0);
*(Lin + min *3 + 0) = *(Lin + i * 3 + 0);
*(Lin + i * 3 + 0) = tmp;
tmp = *(Lin + min *3 + 1);
*(Lin + min *3 + 1) = *(Lin + i * 3 + 1);
*(Lin + i * 3 + 1) = tmp;
tmp = *(Lin + min *3 + 2);
*(Lin + min *3 + 2) = *(Lin + i * 3 + 2);
*(Lin + i * 3 + 2) = tmp;
}
}
}
void Kruskal(float *Lin,int *P,int size,int e)
{
int edge = 0;
float weight = 0;
int k = 0;
char s[ ]={"ABCDEFGHIJKS"};
while(edge != size - 1)
{
if(f_dsf((int)*(Lin + k*3 +0),(int)*(Lin + k*3 +1),Lin,P,e,size))
{
weight +=*(Lin + k*3 + 2);
printf("联结点%c和%c\n",s[(int)*(Lin + k*3 +0)],s[(int)*(Lin + k*3 +1)]);
*(P + k) = 1;//边放入树中
edge ++;
}
k ++;
if(k > e)
{
printf("no tree \n");
break;
}
}
if(k<=e)
{
printf("最优权重为:%.1f\n",weight);
}
}
int main(void)
{
float *Lin;
int *P;
float w;
int size,e;
int i,j,k;
scanf("%d%d",&size,&e);
Lin = (float *)malloc(e*3*sizeof(float));
P = (int *)malloc(e*sizeof(int));
for(i = 0;i < e;i++)
{
*(P + i) = 0;//初始置0
}
for(k = 0;k < e;k ++)
{
scanf("%d%d%f",&i,&j,&w);
*(Lin + k*3 +0)= i;
*(Lin + k*3 +1) = j;
*(Lin + k*3 +2) = w ;
}
SelectionSort(Lin,e);
Kruskal(Lin,P,size,e);
return 0;
}