搜索资源列表
ImageSegmentation
- 用MFC编写的图像分割处理程序，采用了FCM和最小生成树两种方法来对图像进行分割-MFC prepared with the process of image segmentation using the FCM and the minimum spanning tree in two ways to partition images
f.doc
- 题目1：图的建立与遍历；连通网的最小生成树生成实现。 内容： 1） 用邻接表表示方法建立图1所示图的存储结构，用邻接矩阵存表示方法建立图2所示网的存储结构。 2） 在图1 存储结构（邻接表）上实现深度优先搜索遍历和广度优先搜索遍历，并给出遍历结果（序列）。 3） 按照普里姆算法，在图2所示连通网的存储结构（邻接矩阵）上实现此网的最小生成树，并输出生成树。 -Title 1: Map of the establishment and ergodicity conne
ArffSearcher
- 使用Weka分析环境开发的基于Java的图像分割及基于内容检索程序，分割采用最小生成树分割法，检索利用的是小波和共生矩阵提取的特征。-Analysis using the Weka environment for the development of Java-based content-based image segmentation and retrieval procedures, division of segmentation using minimum spanning tree,
prim
- Prim s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the
mini-span-tree
- 关于最小生成树一些算法程序 对于数学建模 图论建模等方面有重要作用-Minimum spanning tree algorithm on a number of procedures for the mathematical modeling aspects of graph theory modeling plays an important role in
jisuanjihedaolun
- 大量领域应用了计算几何的问题,包括欧几里得巡回售货员问题,最小生成树问题,隐藏线问题和线性规划问题-A large number of field applications of computational geometry problems, including Euclid roving salesman problem, minimum spanning tree problem, hidden line problem and linear programming problems, a
Prims_Algorithm
- Prim s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the
suiji
- 最小树算法画图，可以画出最小树算法的路径图-Minimum spanning tree algorithm for drawing
min_tree
- 从conf.txt文件读取无向图矩阵 PRIM算法分步实现最小生成树-File read from conf.txt PRIM algorithm for undirected graph matrix step by step to achieve the minimum spanning tree
mintree
- 一个有 n 个结点的连通图的生成树是原图的极小连通子图，且包含原图中的所有 n 个结点，并且有保持图联通的最少的边。-An n-node connected graph of the minimal spanning tree is the original connected subgraph, and contains all the n original nodes, and there are plans to maintain at least the edge of Unicom.
Prim
- 实现图的显示，最小生成树的动态演示，及最终显示-Achieve chart shows the minimum spanning tree dynamic presentation, and final display
graph-based-image-segmentation
- 五种当前主要的基于图的图像分割方法（normalized cut, min-cut/max-flow, isoperimetric partitioning, minimum spanning tree and random walker）的论文原文。-The original papers of five main graph-based image segmentation methods. They are normalized cut, min-cut/max-flow, isoperi
177969641987
- 3d分形算法生成树的demo ， OpenGL + vs2008-3d fractal algorithm spanning tree demo, OpenGL+ vs2008
tudecaozuo
- 有向图,无向图基本操作,包括: 1、邻接矩阵 2、邻接表 3、深度优先遍历 4、广度优先遍历 5、最小生成树 6、拓扑排序 7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-Directed graph, undirected graph, basic operations, including: 1, 2 adjacency matrix, adjacency table 3, 4 depth-first traversal, breadth-f
chengxu
- 图论中最小生成树Kruskal算法 及画图程序 M-函数-Kruskal minimum spanning tree in graph theory, algorithms and functions for M-Drawing
Kruskal
- VC++代码实现连通图最小生成树的Kruskal算法-VC++ code connected graph Kruskal minimum spanning tree algorithm
Graph-theory-Kruskal-minimum-spanning-tree-algori
- Graph theory Kruskal minimum spanning tree algorithm and Paint program
OntoView-HAG
- 可以对本体图采用最小生成树进行简化，并采用引力法进行布局和绘制。其中绘制采用 OpenGL提供的功能。-This project can visualize ontology graph by minimum spanning tree. It takes force methods to layout the graph. It renders by OpenGL graph libraries.
Prim
- This algorithm to find the minimum spanning tr-This is algorithm to find the minimum spanning tree
MINTREE
- 用各种求解最小生成树的算法实现最小生成树的动态演示-Solving the minimum spanning tree algorithm to achieve the dynamic presentation of the minimum spanning tree