質問編集履歴
3
追記
title
CHANGED
|
File without changes
|
body
CHANGED
|
@@ -19,6 +19,15 @@
|
|
|
19
19
|
j = 0;
|
|
20
20
|
k = 0;
|
|
21
21
|
s = MT() * F_sum;
|
|
22
|
+
|
|
23
|
+
/*AS内の適合度の合計を計算*/
|
|
24
|
+
for (i = 0; i < n_cs; i++)
|
|
25
|
+
{
|
|
26
|
+
/*cs[i]とcs_F[i]は引数*/
|
|
27
|
+
if (AS[i] == 1 && cs[i] != 0)
|
|
28
|
+
F_sum += cs_F[i];
|
|
29
|
+
}
|
|
30
|
+
|
|
22
31
|
/*親の添え字を決定する*/
|
|
23
32
|
while(k < s) {
|
|
24
33
|
if (AS[j] == 1 && cs[j] != 0)
|
2
補足の追記
title
CHANGED
|
File without changes
|
body
CHANGED
|
@@ -54,4 +54,5 @@
|
|
|
54
54
|
}
|
|
55
55
|
```
|
|
56
56
|
|
|
57
|
-
###
|
|
57
|
+
### 補足
|
|
58
|
+
MT()は(0,1)の乱数を発生させる関数です.
|
1
追記
title
CHANGED
|
File without changes
|
body
CHANGED
|
@@ -47,7 +47,7 @@
|
|
|
47
47
|
if(j == n_cs)
|
|
48
48
|
j = 0;
|
|
49
49
|
}
|
|
50
|
-
|
|
50
|
+
/*親の対象がかぶってなければ終了*/
|
|
51
51
|
if(v[0] != v[1])
|
|
52
52
|
break;
|
|
53
53
|
}
|