⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 4.htm

📁 遗传算法的详细描述文档,文档中附带一定的代码解释
💻 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="5.htm">下一篇</a>]
<hr><p align="left"><small>发信人: coy (我爱美好哦), 信区: Algorithm <br>

标  题: 遗传算法(4) <br>

发信站: 武汉白云黄鹤站 (Wed May 31 21:41:05 2000), 站内信件 <br>

  <br>

//copy_matrix.c <br>

  <br>

#include "f:\coy\mywork\lunwen\gaopc\thesis.h" <br>

void copy_matrix(mat1,mat2,lr,ur,lc,uc) <br>

int lr,ur,lc,uc; <br>

MATRIX mat1,mat2; <br>

{ <br>

  int i,j; <br>

  for(i=lr; i<=ur; i++) <br>

    for(j=lc; j<=uc; j++) <br>

      mat2[i][j] = mat1[i][j]; <br>

} <br>

void print_matrix(lr,ur,lc,uc,mat) <br>

int lr,ur,lc,uc; <br>

MATRIX mat; <br>

{ <br>

  int i,j; <br>

  for(i=lr; i<=ur; i++) <br>

    { <br>

    { <br>

      fprintf(output,"\n"); <br>

      for(j=lc; j<=uc; j++) <br>

 fprintf(output,"%5.2f\t",mat[i][j]); <br>

    } <br>

  fprintf(output,"\n\n"); <br>

} <br>

void print_population(r,c,mat) <br>

int r,c; <br>

MATRIX mat; <br>

{ <br>

  int i,j; <br>

  fprintf(output,"\tThe Final Population:\n\n"); <br>

  for(i = 1; i <= r; i++) <br>

    { <br>

      for(j = 1; j <= c; j++) <br>

 { <br>

   if(j == c/2+1) <br>

     fprintf(output,"\t"); <br>

   fprintf(output,"%5.6f\t",mat[i][j]); <br>

 } <br>

      fprintf(output,"\n"); <br>

    } <br>

    } <br>

} <br>

void print_vector(arr,l,u) <br>

VECTOR arr; <br>

int l,u; <br>

{ <br>

  int i; <br>

  for(i=l; i<=u; i++) <br>

    fprintf(output,"%5.2f\t",arr[i]); <br>

} <br>

void print_ivector(arr,l,u) <br>

int l,u; <br>

IVECTOR arr; <br>

{ <br>

  int i; <br>

  for(i=l; i<=u; i++) <br>

    fprintf(output,"%d\t",arr[i]); <br>

  fprintf(output,"\n\n"); <br>

} <br>

  <br>

-- <br>

                             <○> <br>

                              ┃ <br>

  int i; <br>

  for(i=l; i<=u; i++) <br>

    fprintf(output,"%5.2f\t",arr[i]); <br>

} <br>

void print_ivector(arr,l,u) <br>

int l,u; <br>

IVECTOR arr; <br>

{ <br>

  int i; <br>

  for(i=l; i<=u; i++) <br>

    fprintf(output,"%d\t",arr[i]); <br>

  fprintf(output,"\n\n"); <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="5.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 + -