搜索资源列表
Prim_Kruskal
- This program implements both Kruskal s and Prim s Algorithms for deriving minimum spanning trees.
primfindpath
- Prim算法实现在一个有向图中找一条从一点到另一点的一条路，并不要求是最短路。-Use Prim Algorithm to find a way in a digraph.
Minimum-spanning-tree
- 给定一个地区的n个城市间的距离网，用Prim算法或Kruskal算法建立最小生成树，并计算得到的最小生成树的代价-The distance between the network to set a region of n cities, Prim' s algorithm or Kruskal' s algorithm to create a minimum spanning tree, and the calculation of the cost of the minimum s
Graph
- 数据结构图的各种应用操作,Prim Dijkstra Floyd TopoSort Kruscal-various applications of operation of figure
minimumSpanningTree-
- 1． 利用克鲁斯卡尔算法求网的最小生成树。 2． 利用普里姆算法求网的最小生成树。 3． 要求输出各条边及它们的权值。-1. Using Kruskal algorithm for the minimum spanning tree network. 2. Use of the the prim algorithm for the minimum spanning tree. 3. Output edge and their weights.
prim
- 一种最短路径算法，很简单好用的程序，用于研究最短路径算法-A shortest path algorithm, very easy to use program, algorithm for the shortest path
dsaffwefwefq
- prim算法实现程序，以及另外三个小程序集合-prim algorithm procedures, as well as three small collection of programs
prim_suanfa
- 通信网中图论部分PRIM算法生成最小生成树的matlab程序-Communication network center theory of some PRIM algorithm to generate minimum spanning tree of the matlab program
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
graph
- 几乎包含了图的所有操作，邻接矩阵，邻接表建立，递归非递归深搜广艘遍历，floyd,prim,kruscal,地界斯特拉算法，拓扑排序，关键路径-Figure includes almost all the operations, the adjacency matrix, adjacency list creation, deep search recursive non-recursive traversal wide ship, floyd, prim, kruscal, boundary
shudebianli
- （1）将图的信息建立文件； （2）从文件读入图的信息，建立邻接矩阵和邻接表； （3）实现Prim、Kruskal、Dijkstra和拓扑排序算法。 -Will map the information to create documents
GreedyAlgorithm
- Prim,Kruskal,Dijkstra 三个算法的java统一界面实现，可以用同一个界面以及公用一些类与变量，最后还有哈弗曼算法实现，可以作为学习算法的好例子-Prim, Kruskal, Dijkstra algorithm java three unified interface to achieve, you can use the same interface as well as public classes and variables, and finally Huffman a
Maze
- 基于PRIM算法的迷宫生成，并用迭代的方式寻找迷宫路径，可以设置多出口多入口。可以用TXT文件输入迷宫，也可以生成迷宫TXT文件。-PRIM-based maze generating algorithm and finding the maze s path by iteration, you can set up multiple export multiple entrances. you can enter the maze by txt files,and also generate
Graph_Prim
- prim algorith with draw -prim algorith with draw
Graph_Prim
- prim algorith with draw -prim algorith with draw
prime
- 可以用prim算法来生成最小生成树，对于数据结构的学习者有一定参考意义-Prim algorithm can be used to generate the minimum spanning tree data structure for learners are meaningful
prim
- 求最小生成树的vc++工程,特别是在物流中心选择，铺设网络设施等领域，确定最佳连通关系，很有用-a vc++ project for a min generate tree
Prim_MinTree
- Prim算法 最小生成树算法 经过验证 -Prim minimum spanning tree algorithm is validated algorithm
Graphs
- 关于图的一些基本操作：创建、深度遍历、广度遍历、Prim算法、等等。-Some basic operations on graphs: Create, traverse the depth, breadth traversal, Prim algorithm, and so on.
tulun-Prim_Dijkstra
- matlab实现图论中的Prim算法,Dijkstra算法,注释清晰，另外附有报告。-matlab realize Prim algorithm of graph theory, Dijkstra algorithm, clear notes and reports.