VB串口通讯测试源代码，可以打开、关闭端口，可以进行波特率、端口号设置，有文本和图形两种端口数据观察方式、...

xoj里比较经典且比较具有代表性的题目的代码-Comparison of classic and xoj in comparison with the subject of the representation of code! ! !

csv library, which provides functionalities to open, edit, and save data tables to and from csv files.

随机数的获取，用VC实现，随机产生一定范围内的数据-random access, with VC, randomly generated within a certain range of data

VC++2005编写，接收游戏杆、脚蹬输入-VC++2005 prepared to receive joystick, pedal input

用C++实现的队列数据结构。对数据结构和算法的初学者是很好的学习材料。-The file is about queue data structur.It is implemented with C++ language.

第一款：我的日记采用了软件架构，在扩展性... 第二款r使用电脑的人每隔一段基本上都会清理一下垃圾，让自己的电脑跑得更快... 第三款：顶端，最关键的是这... 第四款：格式工厂视频打不开，格式不对？找不到合适的软件帮忙的话，就试试格式工厂。现在大... 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报 打分 发表评论 暂无评论

一款非常简单的刽子手游戏，供业余程序员欣赏！:)

用java做出来的计算器的小程序大家多指教-Out to do with java applet calculator U.S. and more advice

This example consists of two separate projects/applications eir_a for the role A device and eir_b for the role B device and uses the Connection library. * eir_a searches for devices and then displays the information on the devices found. * eir_b makes the device visible and responds to Bluetooth 2.1 Extended Inquiry Response (EIR) requests. This ReadMe is not intended to describe procedures that are covered in the xIDE user guide such as building projects in xIDE etc. -This example consists of two separate projects/applications eir_a for the role A device and eir_b for the role B device and uses the Connection library. * eir_a searches for devices and then displays the information on the devices found. * eir_b makes the device visible and responds to Bluetooth 2.1 Extended Inquiry Response (EIR) requests. This ReadMe is not intended to describe procedures that are covered in the xIDE user guide such as building projects in xIDE etc.

迷宫的问题实质上就是图的遍历问题，我们可以用一个二维数组存储一个迷宫的各个结点，给定一个开始的坐标和一个结束的坐标．本程序可以寻找一条路径，但这条路径不是最短的．就是说不是最优的．-maze is the essence of the plan traverse the problem, we can use a two-dimensional array storage a maze of the various nodes, to set a beginning and an end coordinates of the coordinates. This procedure can find a path, but this is not the shortest path. Not to say the best.