资源列表
graph
- 用邻接多重表实现图的存储、遍历。网上和相关参考书中很少有这方面内容。-Achieved with the adjacent multi-sheet map of the store, traverse. Related reference books online and there are few elements in this respect.
kruskal
- Kruskal s algorithm implementation for graphs
Kruskal
- 数据结构中经典的Kruskal算法的java实现，Java版-Data structure in the classical Kruskal algorithm java implementation, Java Edition
BREAKMATCH
- 数据结构链表的使用 关于多项式中括号匹配是否正确-The use of linked list data structure on the polynomial in the brackets match is correct
sqqQueue
- 数据结构利用队列知识实现杨辉三角的打印以及队列一些基本定义和进队-Knowledge of the use of a queue data structure to achieve Yang Hui Triangle Printing
Sort
- 折半插入排序，在直接插入排序时，插入位置是通过折半查找法确定的。-Binary insertion sort, in the direct insertion sort, the insertion position is determined by binary search method.
baogao
- 数据结构家谱课程设计，对家谱进行操作。包括插入、删除，在文件中操作。-Family tree data structure curriculum design, operate on the family tree. Including insert, delete, operating in the document.
bitree
- 数据结构：二叉树的建立与前序、中序、后序遍历。-Data structure: a binary tree establishment and pre-order, middle order, postorder traversal.
shiyan2
- 本程序主要是使用“子集法”实现NFA的确定化，使用“分割法”实现DFA的最小化，在本程序中用到的主要的数据结构是数组，这些数组是用来存放NFA的初始状态集，及确定化和最小化后的状态矩阵。-This procedure is mainly the use of " sub-set method" to achieve the determination of NFA, the use of " segmentation" to achieve a minimum
seg_test
- 单片机数码管显示的小函数，自己编写的，初学者也许用的上-LED display for a small function, I have written, and beginners may be used in the
ANewLlarge-scaleNetworkAapproximationAalgorithmFor
- 一种新的大规模网络最短路径的近似算法 不错的论文-A new large-scale network approximation algorithm for the shortest path