资源列表
shu123
- 树的数据结构算法，包括二叉树、哈弗曼二叉树，数组变成二叉树等。-Tree data structure algorithms, including binary tree, Hafu Man binary tree array turned into a binary tree.
Intersection
- 三个数组求交集，先求前面两个数组的交集，在和第三个求交集。-Three arrays is seeking to set intersection, consideration is to seek the intersection of the front of the array, and then seek the intersection of the results and the back. This is the most basic method.
Mobile-phone-directory
- 实现的是类似手机通讯录， 实现以下功能： 1) 通讯录编辑（添加、删除）； 2) 按不同的项进行查找； 3) 对已存在的通讯录按不同的项排序； 4) 将通讯录写入文件； 5) 从文件读入通讯录。 -Implementation is similar to the phone contacts, the following functions: 1) Address Book editing (add, delete) 2) Find different
Dijkstra
- 最小生成树Dijkstra算法的实现，包括测试数据，算法准确。-The minimum spanning tree Dijkstra algorithm implementation, including test data, and accurate algorithm.
employee-information-system--
- 用链表实现员工信息系统，通过链表实现 通讯录编辑（添加、删除）； 查找； 排序； 将通讯录写入文件； 从文件读入通讯录。-Employee information system, a linked list, address book editor through the list (add, delete) search sort contacts write to a file read from the file into the address book.
combinatation_dynamic
- 数据结构程序实例，动态规划法求组合数算法的实现-Data structure instance, the dynamic programming method to seek the realization of the number of combinations of algorithms
knapsack01_backtrack
- 数据结构中回溯法求解0-1背包问题的实现-Backtracking to the 0-1 knapsack problem in the data structure
HorseTravel
- 数据结构中例预见算法解骑士游历问题的实现-Cases foreseeable Algorithm for Solving the Knight traveled to the data structure
queen_backtracking
- 数据结构中讲述如何用回溯法求解八皇后问题-Data structure that describes how to use backtracking to solve the eight queens problem
seqlist
- c语言数据结构线性表头文件seqlist-c language data structure of linear header file seqlist
Data-structures-(CPP-2nd-)-Example
- 《数据结构(C++版)(第2版)》例题及一些相关程序设计-Examples of data structures (C++ Edition) (2nd Edition) " and some programming
YUNSUAN
- 集合运算演示系统,包括求集合的交集,并集和差集-Demonstration system set operations, including seeking the collection of intersection, union and difference