📄 14.htm
字号:
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=gb2312">
<title>CTerm非常精华下载</title>
</head>
<body bgcolor="#FFFFFF">
<table border="0" width="100%" cellspacing="0" cellpadding="0" height="577">
<tr><td width="32%" rowspan="3" height="123"><img src="DDl_back.jpg" width="300" height="129" alt="DDl_back.jpg"></td><td width="30%" background="DDl_back2.jpg" height="35"><p align="center"><a href="http://202.112.20.132"><font face="黑体"><big><big>白云黄鹤★</big></big></font></a></td></tr>
<tr>
<td width="68%" background="DDl_back2.jpg" height="44"><big><big><font face="黑体"><p align="center"> 遗传算法 </font></big></big></td></tr>
<tr>
<td width="68%" height="44" bgcolor="#000000"><font face="黑体"><big><big><p align="center"></big></big><a href="http://cterm.163.net"><img src="banner.gif" width="400" height="60" alt="banner.gif"border="0"></a></font></td>
</tr>
<tr><td width="100%" colspan="2" height="100" align="center" valign="top"><br><p align="center">[<a href="index.htm">回到开始</a>][<a href="index.htm">上一层</a>][<a href="15.htm">下一篇</a>]
<hr><p align="left"><small>发信人: coy (我爱美好哦), 信区: Algorithm <br>
标 题: 遗传算法（14） <br>
发信站: 武汉白云黄鹤站 (Wed May 31 21:50:51 2000), 站内信件 <br>
<br>
//p_equalities.c <br>
<br>
#include "f:\coy\mywork\lunwen\gaopc\thesis.h" <br>
int p_equalities(equal,t_var,cart,cart_count,tot_combi) <br>
MATRIX equal; <br>
IVECTOR t_var, <br>
cart; <br>
int cart_count,*tot_combi; <br>
{ <br>
MATRIX p_equal; <br>
int i,j,k,l, <br>
p, <br>
tot, <br>
t_cart; <br>
IMATRIX cartesian; <br>
IVECTOR index; <br>
char status = 'f'; <br>
MATRIX det_arr; <br>
float d; <br>
float d; <br>
p = t_var[1]; <br>
tot = t_var[0]; <br>
t_cart = (int) (factorial(tot)/(factorial(tot - p) * factorial(p))); <br>
cartesian = imatrix(1,t_cart,1,p); <br>
find_probability(p,tot,t_cart,cartesian); <br>
index = ivector(1,p); <br>
det_arr = matrix(1,p,1,p); <br>
p_equal = matrix(1,p,1,p); <br>
l = cart_count; <br>
while((status == 'f') && (l < t_cart)) <br>
{ <br>
for(i=1; i<=p; i++) <br>
for(j=1; j<=p; j++) <br>
p_equal[i][j] = equal[i][cartesian[l][j]]; <br>
l = l + 1; <br>
copy_matrix(p_equal,det_arr,1,p,1,p); <br>
d = det(det_arr,p); <br>
if(d != 0.0) <br>
{ <br>
status = 't'; <br>
l = l - 1; <br>
for(i = 1; i<=p; i++) <br>
cart[i] = cartesian[l][i]; <br>
} <br>
} <br>
if(status == 'f') <br>
{ <br>
fprintf(output,"The equations do not converge\n"); <br>
exit(0); <br>
} <br>
*tot_combi = t_cart; <br>
free_imatrix(cartesian,1,t_cart,1,p); <br>
free_ivector(index,1,p); <br>
free_matrix(det_arr,1,p,1,p); <br>
free_matrix(p_equal,1,p,1,p); <br>
return(l); <br>
} <br>
void bi_deci(prob10,prob,t_cart,tot) <br>
IMATRIX prob10,prob; <br>
int tot,t_cart; <br>
{ <br>
int i,j,k; <br>
for(i=1; i<=t_cart; i++) <br>
{ <br>
k = 1; <br>
for(j=1; j<=tot; j++) <br>
if(prob10[i][j] == 1) <br>
prob[i][k++] = j; <br>
} <br>
} <br>
<br>
-- <br>
＼○／ <br>
┃ <br>
／\ <br>
脖子扭扭，屁股扭扭，大家一起来跳舞 <br>
<br>
※ 来源:．武汉白云黄鹤站 bbs.whnet.edu.cn．[FROM: 211.69.196.11] <br>
[阅读精华区资料] 结束Q, ← │ 上一项资料 U,↑│ 下一项资料 <Enter>,<Space>,↓ <br>
<br>
</small><hr>
<p align="center">[<a href="index.htm">回到开始</a>][<a href="index.htm">上一层</a>][<a href="15.htm">下一篇</a>]
<p align="center"><a href="http://cterm.163.net">欢迎访问Cterm主页</a></p>
</table>
</body>
</html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -