搜索资源列表
Soft20060210162206769
- PRIM算法 一个基本的算法 可以和其他程序结合使用 加密 -EBLSS algorithm for a basic algorithm and other procedures with the use of encryption
2007011402
- 最小树生成算法，用prim算法实现最小树生成-Minimum spanning tree generation algorithm, using prim minimum spanning tree algorithm to generate
kruscal_Primspanningtree
- 最小生成树两种经典算法,kruscal和Prim算法-spanning tree
prim
- 假设G＝(V，E)是连通的，TE是G上最小生成树中边的集合。算法从U＝{u0}（u0∈V）、TE＝{}开始。重复执行下列操作： 在所有u∈U，v∈V－U的边(u，v)∈E中找一条权值最小的边(u0,v0)并入集合TE中，同时v0并入U，直到V＝U为止。-Suppose G = (V, E) is connected, TE minimum spanning tree of G on the set of edges. Algorithm from U = {u0} (u0 ∈ V), TE
test1
- Prim算法的C语言实现，构造连通图，寻找N个点的最短路径。-Prim algorithm C language implementation of connected graph structure, looking for N point of the shortest path.
linux-prim
- LIFO list can resolve this problem because we always wakeup the most recent active thread by default.
quant_common
- prim, start, count, and max_count_{simple,loop,fan should have been defined.
atomic_fetch_xor_explicit
- Set the provoking vertex (the vertex which specifies the prim s color when flat shading) to either the first or last vertex of the triangle or line.
prim
- C语言实现普里姆算法 根据无向网构造最小生成树-C language implementation Prim algorithm based on minimum spanning tree in undirected network structure
zuixiaoshengchengshu
- 最小生成树算法,有n个城市可以用（n-1）条路将它们连通，求最小总路程的和。最小生成树算法，如Prim、Kruskal算法编写最小生成树程序输出最小生成树的各条边-Minimum spanning tree algorithm, there are n cities can use the (n-1) road will connect them, and find the smallest total distance. Respective sides of the minimum span