资源列表
maz
- 用c++实现迷宫程序，自动找到迷宫路径，且能找到最一条最短路径。希望能满足一些人的需要-used to achieve the maze procedure, automatically find the maze path and can find the most a shortest path. Hope to meet the needs of some
xiansuo
- c语言编写的线索化二叉树，采用中序遍历。希望能满足一些人需要。-clues of a binary tree, used the preorder. Hope to meet the needs of some people.
guanjian
- c语言实现关键路径。预先设定图，可输入权值，希望能满足一些人需要-Critical Path. The pre-set plan, the right value to be imported, hoping to meet some people who need
kuaipai
- 用c语言实现数据的快排序。用户输入一组数据，按键控制排序步骤。-data faster sequencing. A user input data, control buttons sequencing steps.
liuxingyu
- 用c语言实现流星雨。流星自右上角落下，碰到地面则消去地面一块砖-used language meteor shower. Instructions from the meteor fall and touched the ground were eliminated from the ground a brick
字符串所有排列
- 给出一个字符串对所有排列的可能性，就是abc，可能排除6种排列-given a string of all with a possibility that the abc may exclude six permutations
WindowsApplication000
- 通过socket，TCP/IP协议，从WEB服务器（填写网站地址或IP地址）下载网页，保存到指定硬盘空间。-through the socket, TCP / IP, from the Web server (fill in Web addresses, or IP address) to download Web pages, designated to preserve disk space.
压缩1
- rlezip -e dirname filename 将文件夹 dirname 中的所有内容打包到 filename 文件里去 dirname 可以是相对路径,也可以是绝对路径 -rlezip-e dirname file folders dirname all elements of a package of documents going dirname filename can be a relative path, and can also be absolute path
clinklist1
- 把一个新的节点数据插入链表，使该节点在链表中位置是nPos； 从链表中删除第一个和 rNode相等的节点； 删除链表中第 nPos个节点 ，释放该节点的空间； 返回和rNode相等的节点； 将链表按节点从小到大排序； 清空整个链表； delete每一个节点返回指定位置的节点数据如 nPos不对，则返回NU-put a new data nodes inserted List so that the nodes are located Linklist nPos; List
aoe2
- 从文件input中读入一个事件结点网络， 并求出各活动的可能的最早开始时间和允许的最晚完成时间、 整个工程的最短完成时间、哪些活动是关键活动、 提高哪些活动的速度能够使整个工程提前完成等等， 并将求出的结果写入到output文件中。 -input write to the output document.
Rs232-CSharp
- This class provides all the necessary support for communicatingwith the Comm Port (otherwise known the Serial Port, or RS232 port).IDE:VS.NET2003
tong11
- 用桶式散列实现一个存储在磁盘中的数据库。 每个记录长128字节，其中4个字节是关键码， 120个字节是数据，其余4个字节存储必要的信息以支持散列表。 已测试通过，此系统支持记录的插入、删除和检索。-bucket used to achieve a hash stored in the disk database. Each record length of 128 bytes, which is a four-byte key code, 120 bytes of data,