资源列表
GreedyAlgorithm
- Prim,Kruskal,Dijkstra 三个算法的java统一界面实现,可以用同一个界面以及公用一些类与变量,最后还有哈弗曼算法实现,可以作为学习算法的好例子-Prim, Kruskal, Dijkstra algorithm java three unified interface to achieve, you can use the same interface as well as public classes and variables, and finally Huffman a
Expression-Evaluator-
- 数据结构,课程设计,表达式计算 c++源码-Data structure curriculum design expression evaluation
BinaryTreeIterate
- 已知中序和后序遍历,求前序遍历.比较笨的方法是画出来二叉树,然后根据各种遍历不同的特性来求,也可以编程求出.-Known inorder and postorder traversal, seeking preorder traversal. Stupid way is to draw out the binary tree, and then iterate based on a variety of different features to find, but also can be pr
UndirectedGraph
- 遍历一遍,判断图分为几部分(假定为P部分,即图有 P 个连通分量),对于每一个连通分量,如果无环则只能是树,即:边数=结点数-1,只要有一个满足边数>结点数-1,原图就有环. -Traverse again, the determination map is divided into several parts (assumed to section P, with P in Figure connected component), for each connected compone
DirectedGraph
- 改进DFS算法代码示例(判断是否是一个有向无环图)时间复杂度:O(n+e)-Improved DFS algorithm code examples (determine whether there is a directed acyclic graph) Time complexity: O (n+e)
c-tong-xu-lu
- 通讯录实训 c 链接文件 c语言实现简单的通讯录系统 -Training contacts
Huffman-coding
- Huffman编码实现压缩算法,带界面。功能较简单。C++编写。-Huffman coding to achieve compression algorithm, with the interface. Function is relatively simple. C++ writing.
quick-sort
- 快速排序算法,数据结构经典排序算法的实现。-Fast sorting algorithms, data structures classic sorting algorithm.
Round-robin-schedule-problems
- 循环赛日程表问题。为多个参赛选手之间应该如何安排比赛提供了解决方法。-Round-robin schedule problems. For multiple players how should the game between the solutions provided.
Dijkstra-AND-kruskal
- 两个数据结构算法的实例,都有注释,浅显易懂-Two examples of data structure algorithms, there are notes, easy to understand
sort
- 排序算法,各种排序,主要是主流排序,插入排序什么的,对几个排序惊醒了个对比,时间复杂度-Sorting algorithm, various sort, mainly mainstream sort, insertion sort something, some sort awakened on a comparison of the time complexity
kucun
- 能简单实现库存的计加入删除和显示的功能。但可能有些地方存在bug。-Can easily achieve the inventory count for deletion and display functions. However, there may be some local bug.
