搜索资源列表
tree
- 最小生成树，有详细注释！Minimum spanning tree, contains a detailed comment!-Minimum spanning tree, contains a detailed comment! Minimum spanning tree, contains a detailed comment!
book2
- A large number of real-world planning problems called combinatorial optimization problems share the following properties: They are optimiza- tion problems, are easy to state, and have a nite but usually very large number of feasible solutions.
BFS
- c语言广度优先搜索算法的实现，输入几个节点，生成树，然后经广度优先搜索算法输出-c language breadth-first search algorithm, enter the number of nodes, spanning tree, and then by the breadth-first search algorithm output
Prim101
- 这是一个构造最小生成树的Prim算法，是属于贪心算法的范畴。设G=(V,E)是连同带权图，V={1，2，3，...，n}。构造G的最小生成树。-This is a structure of Prim minimum spanning tree algorithm is a greedy algorithm category. Set G = (V, E) is, together with the weighted graph, V = (1,2,3 ,..., n). G of the min
kg742
- Rapid expansion of random spanning tree algorithm, Is a good learning materials to learn PCA feature extraction, The method of cumulative contribution rat.
ka181
- PLSon of random spanning tree algorithm, matlab development toolbox support vector machine. PLS toolbox, Rapid expansion of random spanning tree algorithm, matlab development toolbox support vector machine.
cgrmv
- ofdm system simulation including 16qam modulation fft windowing modules plus cp, Relief computing classification weight, Rapid expansion of random spanning tree algorithm.
mf214
- Rapid expansion of random spanning tree algorithm, It draws on principal component analysis algorithm (PCA), There are good reference value.
gberb
- Achieve serial data acquisition, Rapid expansion of random spanning tree algorithm, Codec ldpc code implementatio.