-
java编写的连连看游戏，文件包含源代码，
支持手机游戏
java编写的连连看游戏，文件包含源代码，
支持手机游戏-java games prepared by the 1000 block of Terry Avenue, the paper includes source code, support for mobile phone games
- 2022-05-20 07:24:03下载
- 积分：1
-
mySnikeNew
贪吃蛇游戏，简单，适合初学者.可以加速，变粗(Snake game, simple and suitable for beginners. Can speed up, thick)
- 2011-01-16 18:09:37下载
- 积分：1
-
EasyBuyDemo
易买网项目源码：内有购物车功能，登录，注册，订单管理，商品管理等功能(Easy to buy network project source code: there are shopping cart function, login, registration, order management, merchandise management functions)
- 2020-12-14 09:59:14下载
- 积分：1
-
ESD
静电放电
- 2022-01-28 04:49:12下载
- 积分：1
-
遗传算法（自适应）
说明： 复合材料结构优化 遗传算法 改进的遗传算法(Optimization of composite structure genetic algorithm Improved genetic algorithm)
- 2020-02-24 16:04:13下载
- 积分：1
-
马赛克效果焦点图插件
This is a very interesting jQuery mosaic effect focus map plug-in. The mosaic effect appears when the picture is switched
- 2019-04-25 11:38:38下载
- 积分：1
-
自适应模糊PID
基于matlab及simulink搭建的模糊pid控制系统，参数调试的非常好，控制效果好(Based on the fuzzy PID control system built by MATLAB and Simulink, the parameter debugging is very good, and the control effect is good.)
- 2020-07-01 02:00:02下载
- 积分：1
-
拼写检查器
拼写检查-Spelling Checker
- 2022-03-20 05:46:29下载
- 积分：1
-
等高线拟合源代码（matlab源码），老外编的，水平确实可以，佩服。里面注释挺详细了。...
等高线拟合源代码（matlab源码），老外编的，水平确实可以，佩服。里面注释挺详细了。-contour fitting source code (Matlab source), a foreigner series, level really can admire. Inside Notes quite detailed.
- 2022-07-07 01:48:30下载
- 积分：1
-
局部搜索图着色
说明： 图着色局部搜索,图着色问题（Graph Coloring Problem, GCP） 又称着色问题，是最著名的NP-完全问题之一。道路着色问题（Road Coloring Problem）是图论中最著名的猜想之一。
数学定义：给定一个无向图G=（V, E），其中V为顶点集合，E为边集合，图着色问题即为将V分为K个颜色组，每个组形成一个独立集，即其中没有相邻的顶点。其优化版本是希望获得最小的K值。(Graph Coloring Problem (Graph Coloring Problem, GCP), also known as coloring problem, is one of the most famous NP-complete problems. The Road Coloring Problem is one of the most famous conjectures in graph theory.
Mathematical definition: Given an undirected graph G=(V, E), where V is the set of vertices and E is the set of edges, the graph coloring problem is to divide V into K color groups, and each group forms an independent set. That is, there are no adjacent vertices. The optimized version is to get the smallest K value.)
- 2021-04-01 16:49:10下载
- 积分：1
