资源列表
Shortestpathalgorithmbaseonmapx
- 以经典的最短路径算法——Dijkstra算法为原理，基于Mapx在VisualBasic平台对其算法研究、验证，最终得出算法的可行性-The classic shortest path algorithm- Dijkstra algorithm for the theory, based on its platform Mapx algorithm in VisualBasic, validation, and ultimately come to the feasibility of the
CMXBTree
- CMXBTree 的主要作用是在内存中建立一棵B+树，主要针对数据量较大，查询频繁的数据。总之，CMXBTree 可被视作一个在内存中的数据库使用。其特点是：短小精悍。-CMXBTree major role in the establishment of a memory B-tree, mainly larger volume of data, inquiries frequent data. In short, CMXBTree be deemed to be a memory in th
linked-list
- 链表实现，含创建,打印,两个链表的融合等-Linked List
kmeans
- 数据挖掘（KNN）的算法，VC实现，可以参考参考-Data Mining (KNN) algorithm, VC, and users can refer to reference
guanjianlujin
- 这是数据结构中的关键路径代码，希望带您有所帮助-This is the critical path code in the data structure, and hope that with your help
UFSets
- 是并查集的模板，包括主函数main.cpp，辅助头文件-Is a set of templates and investigation, including the main function main.cpp, auxiliary headers
insertion_sort
- insertion sort with graphs...plotting random elements up to 1000 elements and sort it using insertion sort-insertion sort with graphs...plotting random elements up to 1000 elements and sort it using insertion sort.....
yy6
- 1．定义哈希表数据结构。 2．除留余数法做为哈希函数、 H(key) = key P 用线性探测再散列解决冲突方法，编写函数，实现哈希造表的过程，并输出哈希表。 3．编写函数，求查找成功时的平均查找长度（ASL）。 -1. Define the hash table data structure. 2. In addition to leaving the remainder as the hash function method, H (key) = key P re-h
duipaixu1
- 堆排序的程序，希望能够给大家帮助，写的不好，能够运行而已。-Heap sort program, hoping to give you help, badly written, able to run it.
1718460
- 最小生成树Prim算法 rar 谢谢指教！~()
数据结构模板
- 平衡二叉树 堆排序 快速排序 的直接可用模板(balanced binary tree)
duobianxing
- 计算机算法实习，使用动态规划法实现多边形游戏，通过调试，里面有详细的解释-The computer algorithm internship polygon game using the dynamic programming method to achieve through the debugger, which are explained in detail