资源列表
Bellman-Ford-queue-optimization
- Bellman-Ford算法关键之处在于：只有那些在前一遍松弛中改变了最短路程估计值的顶点，才能引起它们邻接点最短路程估计值发生改变。-Bellman-Ford algorithm that crucial point: Only those former slack again changed the vertex shortest distance estimates, causing their neighbors to the shortest distance estimates ch
sort
- 方式可供选择地进行排序，包括了简单选择排序、堆排序、插入排序、希尔排序、冒泡排序、快速排序-Alternatively way to sort, including a simple selection sort, heap sort, insertion sort, Hill sort, bubble sort, quick sort
main
- 双向循环链表的基本简单实现，适合初学者学习链表。对链表的理解以及对指针的掌握-Two-way circular list of basic simple implementation, suitable for beginners
Bidirectional-bubble-sort
- 排序算法之中的........双向起泡算法......可以当做子程序使用-........ Bidirectional bubble sort algorithm among ...... algorithm can be used as subroutines
calculation-logic-expressions
- c++ 的 数据结构 计算逻辑表达式真值 程序设计报告文档-C++ data structure calculation logic expressions of true value and general test report document design programming
Sorting-Algorithm
- 本排序算法大全包括快速排序算法、堆排序算法、希尔排序算法等等，代码简洁、高效，可直接运行。-The sorting algorithm Guinness including fast sorting algorithm, heap sort algorithm, Hill sorting algorithm, etc., code simple, efficient and can be directly run.
List
- 本程序用数组实现了线性表，基本功能包括：添加、删除、查找、插入、排序等功能。-This program implements an array linear form, the basic functions include: Add, delete, search, insert, sort and other functions.
polynomial
- 本程序实现了多项式的计算功能，代码简洁、高效。-The program implements a polynomial calculation functions, code simple and efficient.
Cpp2
- 通过链表实现输入两个一元多项式，并相加，并输出一个一元多项式-Polynomials, the sum realized by the list enter two one dollar, and outputs a one yuan polynomial
Cpp1
- 根输入字符串创建二叉树，输出二叉树的先根遍历和后根遍历-Root input string to create binary output binary tree traversal and after the first root root traversal
Cpp1
- 用邻接表表示图，重写Dijkstra算法，输入任意带权有向图，输出其每一对顶点之间的最短路径-A diagram showing the adjacency table, rewriting Dijkstra algorithm, with the right to enter any directed graph, the output of each of its shortest path between the vertices
mintree_k
- 最小生成树代码，包括新的方法，思路，过程-Minimum spanning tree code, including new methods, ideas, processes