资源列表
CB-Tree
- C++数据结构中经典B-树的构造方法，功能包括初始化、插入、删除、在控制台输出等功能。-C++ data structure in the classic B-tree construction methods, features include initialization, insert, delete, in the console output and other functions.
Dijkstra
- 用C语言实现迪杰斯特拉算法 简单易懂 界面也较好-With the C language interface easy to understand Dijkstra algorithm is also better
BinaryTree
- 用C语言编写的实现二叉树的一些最基本的操作 有助于初学者的学习-Implementation of C language with some of the basic binary tree will help beginners learn the operation
prim
- 普利姆算法的C语言实现 采用图的数据结构-Plym algorithm using C language data structure diagram
joseph
- 约瑟夫环的仿真问题，用的是没有头结点的链表实现的-Joseph loop simulation problem is not with the head node of the linked list implementation
BST
- 二叉搜索树的一个典型事例，能够处理很多二叉排序树的问题-Binary search tree, a typical example, can handle many issues Binary Sort Tree
compress
- 道格拉斯压缩算法阿索算法 道格拉斯 运用二叉树实现-compress suanfa yasuosuanfa
erchashu
- 用c++编写，输入字符，建立一个二叉树，并进行遍历检查所建立的二叉树是否正确
tree
- 把一个写在文档中的中缀表达式以树的形式输出-To a written document in the form of an infix expression to the output tree
Dijkstra
- 费洛伊德算法 迪杰斯特拉算法 计算两城市直接的最短路径-Feiluoyide count 法迪杰斯特拉 algorithm shortest path directly to the two cities
test
- 两个长度不定的升序链表，两个链表中数据有可能重复，先找到混合的第n个数然后输出后续m个 （可重复），时间复杂度为n。 -Two variable-length list in ascending order, the two data are likely to repeat the list, first find the number of mixed and then output the first follow-up n m a (repeatable), the time com
assn-6-huffman-pc
- 斯坦福大学 A106X 编程课程作业样例 哈弗曼编码C++实现，-Course work at Stanford University A106X Programming C++ code sample Hafu Man realized