-
HANOI非递归算法(带动画演示)
HANOI非递归算法(带动画演示)-HANOI non- recursive algorithm (with the animation demo)
- 2022-12-21 04:55:03下载
- 积分：1
-
用VC++开发了一个数控加工的三维仿真程序，能有效仿真加工过程。...
用VC++开发了一个数控加工的三维仿真程序，能有效仿真加工过程。-With VC++ Developed a three-dimensional simulation of NC machining process simulation can effectively process.
- 2023-04-20 21:10:05下载
- 积分：1
-
RT1602液晶显示的例子,调试已通过,上传给大家
RT1602液晶显示的例子,调试已通过,上传给大家-RT1602 LCD example, debugging has been passed, we look to Upload
- 2022-03-20 03:34:54下载
- 积分：1
-
可以将任意文件转化为bat的东西，详细内容参见源码
可以将任意文件转化为bat的东西，详细内容参见源码-Arbitrary files can be converted into bat things, the details see the source code
- 2022-01-21 02:04:37下载
- 积分：1
-
汉诺塔经典DOS版TC源码
汉诺塔经典DOS版TC源码-HANOR classic DOS version TC-source
- 2022-12-07 12:15:03下载
- 积分：1
-
读取按键状态，按键1按下，P2口连接的发光二极管从左到右亮；按键2按下，P2口连接的发光二极管从右到左亮。...
读取按键状态，按键1按下，P2口连接的发光二极管从左到右亮；按键2按下，P2口连接的发光二极管从右到左亮。-state reading keys, press a button, P2 connectors of the LED-from left to right; 2 Press the button, P2 connectors of the LED-from right to left.
- 2022-11-09 15:45:04下载
- 积分：1
-
带进度条大文件上传源码(单文件多文件都可以传)+v2.0
带进度条大文件上传源码(单文件多文件都可以传)+v2.0-With large file upload progress bar source (single file multiple files can be mass)+ v2.0
- 2022-03-24 02:50:11下载
- 积分：1
-
C programming language source code! Students realize the input, inquiries, inser...
C语言程序设计源程序！实现学生的输入，查询，插入，删除等功能-C programming language source code! Students realize the input, inquiries, insert, delete function
- 2022-09-12 01:20:04下载
- 积分：1
-
关于visual prolog三篇论文
1.VisualProlog智能集成开发环境评述
2.基于VisualProlog的面向对象知识表示
3.浅
关于visual prolog三篇论文
1.VisualProlog智能集成开发环境评述
2.基于VisualProlog的面向对象知识表示
3.浅谈智能程序设计语言VISUALPROLOG的编程-Three papers on visual prolog 1.VisualProlog comments smart integrated development environment 2. VisualProlog-based object-oriented knowledge representation 3. VISUALPROLOG of intelligent programming language programming
- 2022-07-18 18:36:05下载
- 积分：1
-
Create a storage structure of a given graph from the adjacency list and adjacenc...
1 创建给定图的存储结构，从邻接表和邻接矩阵两种存储方式中选择一种。
2 对所创建的图进行深度和广度优先搜索遍历，给出遍历过程中的顶点序列。
3 求图的最小生成树，按构造顺序输出边的序列。（两种方法都要求！）
3 编写一个主函数，将上面函数连在一起，构成一个完整程序。
4 将实验源程序调试并运行。
-Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store. Two pairs of maps created by the depth and breadth-first search traversal, given the culmination of the process of traversal sequence. 3 order to map the minimum spanning tree, according to the order of the output side of the sequence structure. (Both methods require!) 3 to prepare a main function, the above function together to form a complete program. 4 source debugging and running the experiment.
- 2022-04-16 10:47:00下载
- 积分：1
