搜索资源列表
50402417
- 和树类似,图的遍历是图的一种主要操作,可以通过遍历判别图中任意两个顶点之间是否存在路径、判别给定的图是否是连通图并可求得非连通图的各个连通分量,但对于带权图(网),其最小生成树或最短路径都取决于弧或边上的权值,则需要有特定的算法求解。-and similar trees, graph traversal map is a major operation, Discrimination can traverse map between any two vertices existence trai
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
SmallTree123
- 树的遍历及最小生成树问题解决 采用最新Java编程技术-tree traversal and the minimum spanning tree problem solving using the latest Java programming technology
PRIM
- PRIM求最小生成树,JAVA源程序,简洁易懂,很不错的。l
PRIM_MST
- 用java实现了最小求解连通图的最小生成树问题,采用的是prim算法,可供大家参考。
实验报告-最小生成树
- 关于最小生成树问题的基本思想运行结果测试平台以及源码-minimum spanning tree problem on the basic idea of operating results and the source test platform
TSP
- 用A星算法解决TSP问题,其中的择优函数选的是最小生成树-A star with the algorithm to solve TSP problems, the merit function is the minimum spanning tree selected
javaalgorithm
- 包括冒泡排序,归并排序,N皇后,最小生成树等经典算法的java实现代码-Including bubble sort, merge sort, N Queen, such as the classic minimum spanning tree algorithm java code
ShortestPath
- 用A星算法解决的TSP问题,其中的选择函数用的是最小生成树-A star with the algorithm to solve the TSP problems, the selection function using a minimum spanning tree
little-tree
- 基于java的最小生成树,采用canvas画布类和数据结构最小生成树算法实现-Java-based minimum spanning tree, using canvas canvas class and minimum spanning tree algorithm data structure
mst--and-JAVA-graphical-interface
- 最小生成树算法及应用 Java 图形界面-mst JAVA graphical interface
prime
- Prime算法求解最小生成树的java呈现-prime mst
binaryTreeaMST
- 用java语言实现的基于图的Prim算法,实现最小生成树的生成。以及一些二叉树算法的实现,比如哈弗曼编码-Using java language of Prim' s algorithm is based plans to achieve the minimum spanning tree generation. And some of the binary tree algorithm, such as Ha Fuman coding
Prim
- 求解最小生成树的Prim算法,返回构成最小生成树的边集-Prim for the minimum spanning tree,which returns the edge set
DrawImg
- 这个是很好的图形最小生成树的实现,他说明了很多最小生成树的问题,最短路问题都解决了-This is a good realization of minimum spanning tree graph, he shows a lot of the minimum spanning tree problem, shortest path problems are solved
Greedy-algorithm
- 贪心算法 单元最短路径问题 最小生成树问题 多机调度问题-The minimum spanning tree of the the greedy algorithm unit shortest path problem of multi-machine scheduling problem
MainFrame
- 实现可视化界面的最小生成树,通过Java的Swing类来进行的界面可视化,简单方便-Minimum spanning tree of the visual interface, the interface through the Java Swing classes visualization easy
Main
- 普里姆算法(Prim算法),图论中的一种算法,可在加权连通图里搜索最小生成树。意即由此算法搜索到的边子集所构成的树中,不但包括了连通图里的所有顶点,且其所有边的权值之和亦为最小。
EdgeNode
- 使用Java开发编程,解决最小生成树问题。-Developed using Java programming to solve the minimum spanning tree problem.
Graph
- 用户通过输入拓扑结构图,显示拓扑结构图。然后展示最小生成树的生成-Smallest binary