资源列表
strMatch
- 字节流的快速模式匹配算法, 具有比较详细的注释, 供开发时参考. 速度高于 strstr, 且支持字节流. -Byte stream of fast pattern matching algorithms, with detailed notes for reference when developers faster than strstr, support byte stream.
Naigation
- 处理导航数据文件，建立邻接矩阵，采用迪杰斯特拉算法实现庞大数据的简易导航功能，内含原始数据文件和导航数据文件。-processing navigation data file，the establishment of adjacency matrix,the dijkstra algorithm tosearch path.
ggg
- mfc 连接数据库 用mfc做的管理系统，戏中包括数据库连接-mfc connect to the database
Scientific-calculator
- 科学计算器，可以实现文曲星上的科学计算器功能，包括sin，平方，阶乘等-Scientific calculator, scientific calculator function on Wenquxing, including sin, square, factorial
2012.8.11.12.22uart
- 模拟串口 采用中断轮询法 不占用系统只有-Simulation of serial interrupt polling method not only takes up system
ArrayAscendingOrder
- sorting different kind of arrays
FSearch_test
- 一个文件搜索程序 搜索算法速度很优 希望对大家带来帮助-A file search program search algorithm speed is excellent hope to help bring
27691f24aa77.tar
- c++课程设计的实现, 使用list省略了链表的实现, 可以作为课程设计的参考.-c++ curriculum design, use the list omitted the realization of the list, can be used as the reference of the course design.
BiTree
- 1.定义二叉链表类型，建立二叉树。 2.先序遍历二叉树，并输出遍历结果。 3.中序遍历二叉树，并输出遍历结果。 4.后序遍历二叉树，并输出遍历结果。 5.层次遍历二叉树，并输出遍历结果。 6.求二叉树的深度、总结点数、叶子结点数、二叉树的复制。-(1) define a binary linked list type, the establishment of a binary tree. 2 preorder traversal of binary tree, a
Group
- 1.建立并显示图的邻接矩阵。 2.建立并显示图的邻接表。 3.实现图的深度优先和广度优先遍历。 4.实现最小生成树的算法。 5.实现拓扑排序算法。-(1) to establish and show the adjacency matrix. 2 and displays the adjacency table. Depth first and breadth-first traversal of the graph. (4) to achieve the minimum
Lorentz-model
- Lorentz model to describe materials (negative and positive permittivity)-Lorentz model
BinSearchTree
- c语言编写的二叉树问题,用的是链结合二级指针实现,合适初学者学习和使用-c language of the binary tree with the chain binding the two pointers, suitable for beginners to learn and use