资源列表
BellmanFord
- Bellman-Ford算法 在图的应用中遇到负权，则可以采用Bellman-Ford算法来计算单源最短路径。-Bellman-Ford
kcwz-1_kcsjrws
- 数据结构课程设计任务书《数据结构》课程设计任务书-Task of curriculum design data structure book " Data Structures" course design book
123456789
- 最短路径计算,计算两点之间最短的公交线路-The shortest path calculation between two points the shortest bus route
a
- 数据结构课程设计说明书，很好的资料。希望大家喜欢。-Data Structure Course Design Manual, very good information. I hope you like.
create_hash
- hash表的建立相关函数实现，比如，hash表存储数据，hash表插入数据等。-hash table to achieve the establishment of correlation function, for example, hash table to store data, hash table to insert data.
DS
- 本人绝对原创的教学计划编制问题，拿出来和大家一起分享。-I am absolutely in the teaching of original programming problems and work out to share with everyone.
1_ADT
- ADV的数据结构，实现了简单搜索功能-ADV data，and、has a searching engine
search
- 树的遍历（非递归方式实现）：首先按中序方式建立树并输入节点信息，通过栈实现树的非递归方式的先序、中序和后序的遍历-Tree traversal (non-recursive way): First of all, by the way in order to establish the tree and enter the node information, the realization of the tree through the stack of the first non-recurs
siweishuquanshijishu
- 对一个四位数进行判断，如果四个数字 全是奇数则输出-judge a number which has four numbers
MST
- Minimum Spanning Tree implementation using kruskal and prims algorithm.
double_list
- 构建两个双向链表，能够根据第一个链表中的值查询在第二个链表中的相同值的位置-Construction of two two-way linked list, a list based on the value of inquiry in the second list value in the same position
shuju
- 电子课件数据结构第2版。作者 张乃孝,学数据结构的可以看看，大学二年级可用