// for(i=1 i<=n i++) // { // scanf(" d",&w) // HT[i].wi = w // }

本程序利用数据结构中的回溯算法的非递归对以知地图进行全路线查找，可以完成最短路线，最少费用，和所有路线的显示-procedures for the use of the data structure of the back- recursive algorithm right to know what the road map for the entire search, the shortest route to be completed, at least cost, and all the routes show

fortran90编写的关于天线的小程序，实现了近远场变换及方向图的计算等-fortran90 write a small program on the antenna to achieve the near-far field transform and the calculation of the direction of Figure

工控系统串口通讯设计-Serial Communication Control System Design

dappermap设计事例仅仅作为参考-dappermap

用数组解JOSEPHUS问题的程序源码,绝对没有错误-array solution with the procedures JOSEPHUS source, there is no wrong

VC6.0 导入导出注册表，填写要导出的注册表项，如：HKEY_CURRENT_USERSoftwareAdobe，可以导出注册表；同时还可以导入注册表-VC6.0 Import Export Registry, fill out the registry key to export, such as: HKEY_CURRENT_USER Software Adobe, the registry can be exported can also import registry

以一个Ｍ＊Ｎ的长方阵表示迷宫，字符 ＃ 表示障碍， ＠ 表示＂死胡同＂， ＊ 表示路径上的位置． 本程序只求出一条成功的通路-An M*N represent maze,character "#" represent obstacle,"@" represent an dead end,"*" as position on the route. Only one successful gateway is obstained.

计算BMI值，并利用毒方

试试看，是个一般的文件，我想可以的，不知道这次行不行-Try and be a general document, I think it is, do not know this is feasible

五子轮流翻 由VB 做的-five-fold rotation so VB