-
GE数据转换器ggfgfd gdf gdf
GE数据转换器ggfgfd gdf gdf-data converters ggfgfdgfdgdfgdfgdfgdfgdf
- 2022-01-25 15:39:31下载
- 积分：1
-
Car that can follow the black lines using the sensors
利用红外发射器和接收器 使小车能够沿着地面上的黑线循迹前进-Car that can follow the black lines using the sensors
- 2022-01-22 15:52:07下载
- 积分：1
-
本原码用VB2005演示了串口控制,多线程的实现,程序性指
本原码用VB2005演示了串口控制,多线程的实现,程序性指-primitive code using VB2005 demonstration of serial control, multi-thread and that the realization of procedural means
- 2022-03-11 00:36:02下载
- 积分：1
-
Z-wave 软件开发包（SDK）
资源描述z-wave SDK 如果有开发z-wave通信协议的童靴可以借鉴下哦 资料很全的，有相应的PDF说明文档！
- 2022-04-10 18:53:11下载
- 积分：1
-
演示程序，数字应该是任意的，我们必须先输入…
本演示程序中，人数n应为任意的，首先应输入一个值赋给初始报数上限m，程序应能自动保存出列人的序号和将出列的人所持的密码赋给m，再次作为报数上限，如此循环，直至所有人都出列为止。-The demonstration program, the number n should be arbitrary, we must first enter a value assigned to the initial reported that the maximum number of m, the procedure should be able to automatically save a list of the serial number of people and held out the password assigned to m, again reported as the maximum number of such cycles, until all that far out.
- 2022-03-07 19:25:59下载
- 积分：1
-
vb source for information
vb写的源程序供参考-vb source for information
- 2022-02-07 10:07:17下载
- 积分：1
-
平衡二叉树操作的演示
一、 需求分析
（1） 利用平衡二叉树实现动态查找表。实现查找，插入和删除三种基本功能。
（2） 初始，平衡二叉树为空树，操作...
平衡二叉树操作的演示
一、 需求分析
（1） 利用平衡二叉树实现动态查找表。实现查找，插入和删除三种基本功能。
（2） 初始，平衡二叉树为空树，操作界面给出查找，插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时，显示更新的平衡二叉树。
（3） 重点在于对删除算法的实现。假设要删除的关键字为X的结点，若X不在叶子结点上，则用左子树中的最大值或者右子树中的最小值取代X。如此反复，直到删除动作传递到某个叶子结点，删除叶子结点时，若要进行平衡变换，可采用插入的平衡变换反变换。
-balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Ins
- 2022-03-05 06:54:53下载
- 积分：1
-
Collision detection (using Monte Carlo simulation on the target hit probability...
碰撞检测（用蒙特卡洛法对目标命中概率进行仿真分析）-Collision detection (using Monte Carlo simulation on the target hit probability analysis)
- 2022-05-23 10:02:15下载
- 积分：1
-
Including a number of VC programming examples, although the procedure is relativ...
包括了一些VC编程实例，虽然程序比较小但对于初学者还是很有帮助的-Including a number of VC programming examples, although the procedure is relatively small but still helpful for beginners
- 2022-02-06 03:10:57下载
- 积分：1
-
最小和米！这是动态规划的实现！顶
最小M段和问题！ 这个是用动态规划实现的！ 自顶向下的备忘录方法实现的！-smallest and M! This is the realization of dynamic programming! Top-down approach to achieve the memorandum!
- 2022-05-06 01:29:30下载
- 积分：1
