搜索资源列表
Kru
- Kruskal算法，Kruskal算法的时间复杂度为 ，与图中边数有关，而与图中的顶点数无关，因此该算法适合与求边稀疏的网的最小生成树。-Kruskal algorithm, the algorithm Kruskal time complexity of, and chart the edge, with map unrelated to the number of vertices, and the algorithm for edge for the sparse network of m
50402417
- 和树类似，图的遍历是图的一种主要操作，可以通过遍历判别图中任意两个顶点之间是否存在路径、判别给定的图是否是连通图并可求得非连通图的各个连通分量，但对于带权图（网），其最小生成树或最短路径都取决于弧或边上的权值，则需要有特定的算法求解。-and similar trees, graph traversal map is a major operation, Discrimination can traverse map between any two vertices existence trai
MSTree
- 最少生成树问题，MST（最小生成树），具体功能很容易看懂的-minimum spanning tree problem, MST (minimum spanning tree), specific functions can easily understand the
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
最小生成树耶
- 最小生成树-minimum spanning tree
实验报告-最小生成树
- 关于最小生成树问题的基本思想运行结果测试平台以及源码-minimum spanning tree problem on the basic idea of operating results and the source test platform
dtree.rar
- 在dtree基础上改造的带checkbox的树形结构，并可遍历生成树，取得选中的checkbox id,并可设置checkbox默认选中,Dtree transformation in the basis of the tree structure with checkbox, and spanning tree traversal to obtain the selected checkbox id, and set the checkbox to select the default
TSP
- 用A星算法解决TSP问题，其中的择优函数选的是最小生成树-A star with the algorithm to solve TSP problems, the merit function is the minimum spanning tree selected
tree
- 生成树控件，可以点击并展开书，可以复选框选择。-Spanning tree control, you can click and launch the book, you can select the check box.
javaalgorithm
- 包括冒泡排序，归并排序，N皇后，最小生成树等经典算法的java实现代码-Including bubble sort, merge sort, N Queen, such as the classic minimum spanning tree algorithm java code
bbs-JSP
- 北大青鸟的jsp版本的BBS，使用的是SQL Server 2005数据库，里面实现了分页，动态生成树结构等，而且页面效果也非常的美观。-Beida Jade Bird jsp version of the BBS, you are using SQL Server 2005 database, which has paging, dynamic spanning tree structure, and the page is also very beautiful effect.
ShortestPath
- 用A星算法解决的TSP问题，其中的选择函数用的是最小生成树-A star with the algorithm to solve the TSP problems, the selection function using a minimum spanning tree
tree
- this program is used to computer the minimum spanning tree given some terminals nodes
Tree
- program in java to construct a minimum spanning tr-program in java to construct a minimum spanning tree
little-tree
- 基于java的最小生成树，采用canvas画布类和数据结构最小生成树算法实现-Java-based minimum spanning tree, using canvas canvas class and minimum spanning tree algorithm data structure
minimum-spanning-tree-by-matlab
- minimum spanning tree by matlab
tree
- 最小生成树算法的动态演示，具有良好的交互性，支持用鼠标绘图和绘点，Prim算法和Kruskal算法两种的动态过程。-Dynamic presentation minimum spanning tree algorithm, with good interaction, support the use of the mouse for drawing and painting point, Prim algorithms and dynamic process of two of Kruskal&
tree
- 采用数据结构里的邮箱图的最小生成树算法,实现查找一棵最小生成树的算法-Using the mailbox in the data structure diagram of the minimum spanning tree algorithm, to find a minimum spanning tree algorithm
tree
- 快速生成树，遍历树节点，性能优，快速，可靠(Rapid spanning tree traversal tree node, performance is superior, fast and reliable)