ini adalah program anak keperawatan

组合数学全序列生成的Java实现，共实现了五种算法，有图形界面，需要安装substance库

FIR滤波器系数计算 C源码，有多种加窗处理-FIR filter coefficients C source code, plus a variety of window treatment

用c编写的N皇后问题-used to prepare N Queens

This algorithm was developed by Professor Ronald L. Rivest of MIT and can be found presented in several languages. What I provide to you here is a C++ derivative of the original C implementation of Professor Rivets. The library code itself is platform-independant and has been tested in Redhat Linux. I ve included the sample code and makefile that I used for the Linux test. The demo, however, was written with Visual C++ 6 on a Windows 2000 platform.-This algorithm was developed by Professor Ronald L. Rivest of MIT and can be found presented in several languages. What I provide to you here is a C derivative of the original C implementation of Professor Rivets. The library code itself is platform-independant and has been tested in Redhat Linux. I ve included the sample code and makefile that I used for the Linux test. The demo, however, was written with Visual C 6 on a Windows 2,000 platform.

旅行推销员问题(TSP) 或旅行推销员问题询问以下问题： 鉴于城市和每一对城市之间的距离的列表，什么是最短的可能路线的一次访问每个城市，并返回到原籍城市？它是一个NP 难问题在组合优化中，重要的业务研究和理论计算机科学。

实际的单片机应用系统开发过程中，由于程序功能的需要，经常编写各种延时程序。延时时间从数微秒到数秒不等。对于许多C51开发者，特别是初学者，编制非常精确的延时程序有一定难度。本文从实际应用出发，讨论几种实用的编制精确延时程序和计算程序执行时间的方法，并给出各种方法使用的详细步骤，以便读者能够很好地掌握理解。

一款开源基于电子电路理论支持编写的电子电路模拟和分析小软件，可以对电子电路初学者进行模拟试验有点帮助。支持简单电路、串联电路、并联电路、交流电路的R,L,C串行电路，交流电路的双回路电路，交流电路的三回路电路的模拟和分析，并提供输出结果和线路图。-An open source-based electronic circuit theory to support the preparation of electronic circuit simulation and analysis of small software, can be carried out on the electronic circuit simulation beginners to some extent. Support a simple circuit, series circuit, parallel circuit, communication circuit R, L, C serial circuit, the exchange of double-loop circuit circuits, communication circuits three-loop circuit simulation and analysis, and provide output results and the circuit diagram.

通过深度优先算法，遍历网络中的每个结点，得到遍历网络节点的时间-Through the depth-first algorithm, network traversal each node, the network node traversal time

深度优先遍历图的方法是，从图中某顶点v出发： （1）访问顶点v； （2）依次从v的未被访问的邻接点出发，对图进行深度优先遍历；直至图中和v有路径相通的顶点都被访问； （3）若此时图中尚有顶点未被访问，则从一个未被访问的顶点出发，重新进行深度优先遍历，直到图中所有顶点均被访问过为止。　当然，当人们刚刚掌握深度优先搜索的时候常常用它来走迷宫.

csma-ca 算法的源代码，欢迎大家一起探讨-csma-ca algorithm source code, welcome you to explore