资源列表
Depth-First-Traverse
- 此代码为“图的深度优先遍历”的源代码，图的存储形式为邻接矩阵，里面有图的邻接矩阵存储的代码，有深度优先遍历的算法，还有验证的主函数。-This code for the " depth-first traversal map" of the source code, Figure storage form of adjacency matrix, there are plans stored in the adjacency matrix code, a deep traver
Broad-First-Search(AdjLGraph)
- 此代码为“图的广度优先遍历”的源代码，图的存储形式为邻接表，里面有图的邻接表存储的代码，还有广度优先遍历的算法，还有验证的主函数。-This code is " breadth-first traversal map" of the source code, Figure storage form of adjacency list, there are plans stored in the adjacent table code, as well as breadth-fi
Link-Queue
- 链式队列的存储结构以及功能实现，有QueueTraverse(),EnQueue(),DeQueue()等子函数。-Queue chain structure and function of the realization of storage, there are QueueTraverse (), EnQueue (), DeQueue () Function, etc..
huiwen
- 回文问题，这是很有意思的一个问题，通过数据结构中的顺序队列可以解决。-Palindrome, which is a very interesting problem, through the data structure in the order in the queue can be resolved.
prim
- 普里姆算法，求图的最小生成树问题。用的是C语言，比书上的详细。-Prim algorithm, and the minimum spanning tree problem Fig. Using the C language, the detailed than the book.
RIPprogram
- a RIP distance vector implementation for a simple graph
telephone
- a simple data structure code
POINTSTR
- a simple code for using pointer in data structure
POLYLINK
- a simple program for link lists in C-a simple program for link lists in C++
linklist
- 链表的实现.包括初始化，删除，插入，排序，计算大小等。-linklist
xitidaan
- <数据结构与实训> \1-8章习题答案-< Data Structures and Training> \ 1-8 Chapter Exercises answer
java
- 数据结构Java版，喜欢研究的可以下载-Java version of the data structure, like the study can be downloaded to see if