资源列表
tudeshenduyouxiansousuo
- 用图的遍历，邻接矩阵实现图的深度优先搜索，-Graph with adjacency matrix to achieve the depth-first search,
shenduyouxiansousuo(linjiebiao)
- 图的遍历，用邻接表实现图的深度优先搜索建的工程实现-Graph traversal, with the adjacency list graph depth-first search to achieve the construction of the project implementation
Primsuanfa
- 用prim算法求带权图的最小生成树，最小生成树的边集合存在mst数组中-With prim algorithm for getting the right plan with the minimum spanning tree, minimum spanning tree of the edge set of the array there mst
guangduyouxiansousuo
- 这是通过图的遍历操作实现图的广度优先搜索，是通过邻接矩阵实现的-This is achieved through the operation of graph traversal graph breadth-first search is implemented through the adjacency matrix
n
- n后问题的排列树，不全，要改进，排列树的似乎没人使用-n the arrangement after the problem tree, failure to improve, it seems that no one ordered the tree to use
Cpp2
- 标志符树与表达式求值 有前序遍历 中序遍历 后序遍历 并用后序遍历求表达式-the technology of shu
Matrix
- 一个在数据量较大时效率较高的矩阵乘法实现，思想来源于《算法导论》-When a large amount of data more efficient implementation of matrix multiplication, thinking from " Introduction to Algorithms"
code
- 各种数据结构代码,欢迎下载,里面有JAVA,C,C++等等各种版本-Data structure and code, please download
rex2
- SSD5 Recommended Exercise 2 满分-SSD5 Recommended Exercise 2
RecommendedExercise1
- SSD5 Recommended Exercise 1 -SSD5 Recommended Exercise 1
enhancedsafearray
- SSD5 exam1 源码 96分 多点注释就满分了-SSD5 exam1
EnhancedLinkedList
- SSD5 op ex1 满分啊 -SSD5 op ex1