资源列表
Dijkstra
- Java实现Dijkstra算法，单一起点到终点。-Dijkstra Java
Spanning-Tree-the-Kruskal-method
- 用C++实现了最新生成树协议，克鲁斯卡尔方法在很多领域都会经常用到，比如操作系统和计算机网络。-C++ implementation of the latest Spanning Tree Protocol, Kruskal methods are often used in many fields, such as operating systems and computer networks.
一元多项式
- 一元多项式相加数据结构算法-sum of one yuan polynomial algorithm data structure
biaohao
- 最大流量Prim 算法寻找最小生成树,用C语言实现,有完整的注释-maximum flow Prim finding minimum spanning tree algorithm, using C language, a complete Notes
2
- 2叉树建立以及遍历 2叉树建立以及遍历-2-tree-building as well as the 2-tree traversal, as well as the establishment of ergodicity
kruskal
- kruskal( 利用堆，并查集（即树的等价问题）实现) -kruskal (the use of heap, and check collection (that is, the issue of tree-equivalent) to achieve)
Network-node-shortest-path
- 此代码实现了网络结点之中最短路径的计算，并输出了各个网络结点的路由表 ，路由表包括：目的网络，下一跳，代价，详细地址。此代码的原理是Dijstra算法。在代码的注释中有测试用例,用户测试时只需将程序运行后再将测试用例复制到DOS黑框中即可。测试用例中有详细的用例解释。-This code implements the network nodes being the shortest path calculation, and output of each network node routi
example
- 建立一棵二叉排序树并输出该树的结构，然后让用户输入下列操作符：i(插入),s(查找),d(删除),p(输出结构),q(退出程序)，程序执行相应操作。-Create a binary sort tree and outputs the structure of the tree, and then let the user enter the following operators: i (insert), s (find), d (delete), p (output structure), q
strcmp
- 设计一个strcmp算法，实现两个字符串s和t的比较-To design a strcmp algorithm comparison of two strings s and t
xishujuzhendexiangcheng
- 数据结构中用三元数组实现稀疏矩阵的相乘算法源代码-Data structures implemented using triplet sparse matrix multiplication algorithm source code
calcmulate-0
- 给定一个整数N,求N的阶乘末尾有多少个0 应用程序的每个文件的内容。-Given an integer N, N factorial seeking the end there is the content of the application number 0 for each file.
Double_List_and_Sort
- 双链表和排序,排序有四种，冒泡、插入、选择、折半-double list and sort