-
两人对弈的五子棋游戏。能判断两个的胜负。用鼠标控制。界面友好。...
两人对弈的五子棋游戏。能判断两个的胜负。用鼠标控制。界面友好。-331 games. Two of the ability to determine the outcome. Using mouse control. Friendly interface.
- 2023-05-08 07:35:03下载
- 积分：1
-
matched numbers automatically generated maps, data source to a comma
双色球号码分布图自动生成器，数据源文件为一个以逗号分隔的文本-matched numbers automatically generated maps, data source to a comma-separated text
- 2022-03-21 21:47:39下载
- 积分：1
-
这些文件包含编码和文档
these files contain coding and documents-these files contain coding and documents
- 2023-08-11 14:50:03下载
- 积分：1
-
实现了一个在微秒的例子
本实例实现了一中微秒级的精确定时,利用多媒体定时器的基本功能，可以通过两种方法实现精确定时。1）使用timeGetTime()函数，该函数定时精度为ms级，返回从Windows启动开始所经过的时间。2）使用timeSetEvent()函数.-Achieved one of the examples in the microsecond-level precision timing, use the basic functions of multimedia timer can be two ways to achieve precise timing. 1) Use timeGetTime () function, which ms timing accuracy for the class, to return from the Windows start after the beginning of time. 2) the use of timeSetEvent () function.
- 2022-03-06 14:13:58下载
- 积分：1
-
这是我大二时写的一个迷宫程序，可以实现从任意一个地方走到所指定的终点...
这是我大二时写的一个迷宫程序，可以实现从任意一个地方走到所指定的终点-This is the second year when I wrote a maze procedure can be achieved from any one place come to the designated destination
- 2022-10-29 20:35:03下载
- 积分：1
-
线程间的数据共享
线程间的数据共享-threads of data sharing
- 2022-08-22 06:25:07下载
- 积分：1
-
进程管理系统创建调度通信撤消可监控驱动程序开发
进程管理系统创建调度通信撤消可监控驱动程序开发
-process management system to create scheduling withdrawal of monitoring communications Driver Development
- 2022-01-25 22:12:41下载
- 积分：1
-
one of the Text file conversion to PDF files based VC#. Net procedures and code...
一款关于 Text文件转换为PDF文件 的基于VC#.Net的程序及代码,是初学者及中级水平人士的良好教材. 机会不容错过!-one of the Text file conversion to PDF files based VC#. Net procedures and code of beginners and intermediate levels of good teaching. The opportunity should not be missed!
- 2022-07-09 07:52:18下载
- 积分：1
-
离散二进制猫群算法
这个关于一种离散二进制猫群算法的代码，采用测试函数来测试这个算法的性能，参考文献为Sharafi Y, Khanesar M A, Teshnehlab M. Discrete binary cat swarm optimization algorithm[C]// International Conference on Computer,control & Communication. IEEE, 2013:1-6. 这个代码包和这篇文献是同步，大家可以看这篇文献，它的实现则是这些代码
- 2022-05-17 02:39:41下载
- 积分：1
-
K r u s k a l算法每次选择n
K r u s k a l算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的
边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选
取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步，其中e 是网络中
边的数目。按耗费递增的顺序来考虑这e 条边，每次考虑一条边。当考虑某条边时，若将其
加入到已选边的集合中会出现环路，则将其抛弃，否则，将它选入。-K ruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left edge select does not produce a loop with the smallest cost edge has been selected to join the edge of the collection. Taking note of the selected edges have a loop if it can not form a spanning tree. K ruskal algorithm sub-e-step, in which e is the number of network edge. According to the order of incremental cost to consider this e edges, each taking a side. When considering a certain edge when, if its added to a collection of selected edge loop will appear, will be its discarded, otherwise, it selected.
- 2023-02-08 08:10:04下载
- 积分：1
