资源列表
Prim
- 描述tree的運用，並且利用Prim s來解決次問題-Describe the use of tree and use Prim' s to solve the time problem
find-the-location-of-1
- 实现或者一个整数从低位起第一个置位比特位置。-Make or an integer a first set of bits the low position.
biaodashi
- 计算输入表达式的值，讲前缀表达式转化为中缀表达式，利用堆栈-computational formula
Graph3
- 最小生成树的贪心算法实现 普里姆算法 用邻接矩阵进行图的生成-the minimum spanning tree algorithm Primbetov greedy algorithm adjacent matrix chart generation
Leasen图的建立和DFS&BFS算法
- 数据结构中关于DFS和BFS的练习，较简单的实现了二叉树的DFS和BFS搜索-data structure of DFS and BFS practice, the realization of a simple binary tree search DFS and the BFS
BigNumber
- 一个数据结构来存储超大型数字以及一种算法来实现超大整数加法运算。-a data storage structure and a super digital algorithm to achieve super integer multiplications.
City
- 将若干城市的信息，存入一个带头结点的单链表。结点中的城市信息包括：城市名，城市的位置坐标。要求能够利用城市名和位置坐标进行有关查找、插入、删除、更新等操作。-The number of towns and cities, into a single list to take the lead node. Nodes in the city information, including: City name, the city coordinates. Required to use the
Graph_all.c
- All graph algorithms thats helps to understand the concepts
asdcv
- 利用哈希函数对学生姓名进行最优化查找 可选择从键盘输入和文件输入,需输入名字最大长度-hash function to the students find the most optimal choice from the keyboard input and the input document, name must be imported maximum length
mtqp1
- 马踏棋盘的源程序！实现国际象棋中马走遍整个棋盘！
the-definition-of-order-form
- 如何建立顺序表及顺序表的操作比如插入删除查找-How to establish the order form and order operations such as inserting a table lookup, and so remove
cc
- 全排列 字典序 生成 算法 实现-The whole arranged in the lexicographical generation algorithm