stoi

基于matlab平台，利用A*算法求解3d的路径规划问题，下载后可直接运行，亲测有效(Based on the MATLAB platform, the A* algorithm is used to solve the path planning problem of 3D. After downloading, it can run directly and effectively)

jQuery支持时分秒日期选择代码是一款jQ时间选择控件。(JQuery supports time, second and date selection code, which is a jQ time selection control.)

台达PLC上位机通讯，读写PLC数据发给广州数控机器人模拟视觉数据(Delta PLC host computer communication, read and write PLC data to Guangzhou CNC robot simulation visual data)

Flash整站模板源文件，运行于PHP环境的Flash网站源码，Flash与PHP交互实现动态数据的显示。模板以白色简洁色调为主，可用Flash8对其编辑和修改。

这是我的计算机图形学的实验――梁友栋算法-This is my experimental computer graphics-- friends of Liang Dong Algorithm

Constant & Macros in OpenGL

本题编写程序模拟人进行连连看游戏，电脑模拟人玩连连看的过程如下： 1、分析本局游戏，将本局游戏转化成一个二位数组。0表示空白区域，数字表示该游戏牌为出现在游戏中的第几类游戏牌。 2、利用广度优先搜索算法，判断两个游戏牌是否可以消除。 3、程序模拟人点击可以消除的一对游戏牌进行消除。 对某局游戏转化成二维数组如下： 0 0 0 0 0 0 1 2 0 0 0 0 3 4 0 0 0 0 1 0 输入二位数组的行、列，二位数组、起始元素的的坐标、终止元素的坐标，判断起始游戏牌和终止游戏牌是否可以消除。 对上例输入 4 5 0 0 0 0 0 0 1 2 0 0 0 0 3 4 0 0 0 0 1 0 1 1 3 3 输出 TRUE(The writing program simulates the game, and the computer simulates the process of watching the game as follows: 1. Analyze the game and convert the game into a two - bit array. 0 is the blank area, the number indicates that the game card is the number of game cards that appear in the game. 2. Use the breadth first search algorithm to judge whether the two game cards can be eliminated. 3, the program simulates a pair of game cards that can be eliminated by clicking. A game of a game is transformed into a two-dimensional array as follows: 00000 01200 00340 00010 Input the row and column of the two bit array, the coordinates of two bit array, the initial element, and the coordinates of the termination elements, so as to determine whether the initial game card and the ending game card can be eliminated. For example input 45 0000001200 0034000010 11 33 Output TRUE)

说明：  基于NSGA-II的有约束限制的优化问题实例matlab编程代码(Matlab programming code based on nsga-ii constrained optimization problem)

输出某个路径及其子目录下的所有文件路径,以便查找所需的文件。(Output all file paths under a path and its subdirectories to find the files you need.)

说明：  进化算法中解决多峰优化问题的经典算法 LIPS(LIPS: A Classical Algorithms for Multi-modal Optimization in Evolutionary Algorithms)