搜索资源列表
matlog
- 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman
MSTVisual
- 最小生成树的算法演示,可自由添加结点和移动结点,边的权重也可自由更改-minimum spanning tree algorithm demonstration of the freedom to add nodes and mobile nodes, while the weights are free to change
Data_Struction_prim_MST
- 数据结构作业代码。 最小生成树 Prim实现。 win32 Console界面。-operation code data structure. Prim achieve the minimum spanning tree. Win32 Console interface.
kruskal_matlab
- 最小生成树的kruskal算法 自己写的 要是再说有重复 我可就怒了-the Kruskal minimum spanning tree algorithm wrote it myself if I say that there is no duplication of anger on
7_7Kruskal
- 最小生成树的经典算法——Kruskal算法。用C++实现-minimum spanning tree algorithm classic-- Kruskal algorithm. C to achieve
prime-tree
- 最小生成树:利用普鲁姆算法,完成将给定节点和边的权值的图生成最小生成树,用于各项公共事业最少经费的设计方法-minimum spanning tree : pass algorithm, Givens completed nodes and the right side of the value of the minimum spanning tree generation for public utilities at least f
GraphSmalltree
- 演示了最小生成树的普林算法和克鲁斯卡尔算法得算法过程。-demonstration of the minimum spanning tree algorithm and Chapline Kelushikaer algorithm algorithm in the process.
tubianli
- 以邻接表为存储结构,实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点,分别输出每种遍历下的结点访问序列和相应生成树的边集。-table adjacent to the structure for storage, connectivity to the map without the depth and breadth of priority priority traversal. Users designated as
Soft20060210100933557
- 图的建立、遍历、最小生成树、最短路径 图的建立、遍历、最小生成树、最短路径-plans the establishment, traverse, the minimum spanning tree and the shortest road map for the establishment of traversal, minimum spanning tree, shortest path
TJlSg
- 数据结构课程设计!MFC做的! 其中有个是链表(单链表,双向 链表图形化演示),另一个是 图的最小生成树的图形化演示)。-data structure course design! MFC done! Which is a linked list (single linked list, and two-way linked list graphic demonstration), Another is the minimu
prim_rar
- prim算法 是一个比较常见的求最小生成树的算法,它用贪婪准则来编写算法的!-prim algorithm is a more common for the minimum spanning tree algorithm, which used to prepare guidelines for the greedy algorithm!
min-spantree
- Reduce the number of data points using a spanning tr-Reduce the number of data points using a spa nning tr
XiaoYuanDaoYouTu
- 本人用C++编写的一个校园导游图。欢迎界面是我们学校的。用的时候随时改成你学校的就成。:) 通过最小生成树算法和两点间最短路径算法,实现查看两景点间最短路径和查看最佳游览路线。-I prepared a campus tour guide map. We welcome the interface schools. Used anytime when you changed it into schools. :) Minimu
grapher
- 用图形用户界面表示的图,数据结构基本应用,最小生成树算法,最短路径,广度、深度优先搜索-graphical user interface with the plan said, the basic data structure application, the minimum spanning tree algorithm, the shortest path, breadth, depth-first search
minitree
- 这是用VC实现的一个查找最小生成树的程序,界面很漂亮,实现的功能也很好。具有固定的节点,权值可以任意输入,最后确定一个最小的生成树。-This is the VC search for a minimum spanning tree procedures, a very nice interface, function very well. Having fixed nodes, the weights can be arbitrary
zuixiaoshengchengshu
- 最小生成树问题 若要在n个城市之间建设通信网络,只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网,是一个网的最小生成树问题。 (1)利用克鲁斯卡尔算法求网的最小生成树。 (2)实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。 (3)以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-cit
mintreek
- 图论中最小生成树Kruskal算法 及画图程序 M-函数 格式 [Wt,Pp]=mintreek(n,W):n为图顶点数,W为图的带权邻接矩阵,不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图 例如 n=6 w=inf*ones(6)
minimumspanningtree
- 给出一个连通带权的无向图,找出该图的最小生成树。并带有问题的详细描述及测试数据。-Given a connected weighted undirected graph, find the minimum spanning tree graph. With a detailed descr iption of the problem and the test data.
minThree
- 数据结构的课程设计 图的最小生成树,自己做的-Data structure of the curriculum design of minimum spanning tree, do their own
PRIM
- PRIM求最小生成树,JAVA源程序,简洁易懂,很不错的。l-PRIM for minimum spanning tree, JAVA source, concise and understandable, it is good. l