Description: 数据结构中的求强连通分量的源程序，用vc6.0来编写-data structure for the strongly connected component of the source used to prepare vc6.0 Platform: |
Size: 1024 |
Author:叶芦芦 |
Hits:
Description: 递归算法求一个有向图的强连通分量，输入格式如压缩包中data4.txt，第一行为顶点个数。输出到result.txt中。-recursive algorithm for a directed graph strongly connected component, the input format such as compression package data4.txt. the first acts of the number of vertices. Result.txt exported to China. Platform: |
Size: 7168 |
Author:王军 |
Hits:
Description: 实现了图的主要操作:（1）分别用邻接矩阵和邻接表实现图的基本操作（包括图的广度和深度优先搜索）；(2）判断该图是否连通，输出该图的连通分量数目；（3）输出一个每一个连通分量的最小生成树。-The main achievement of the plan steps: (1), respectively, with adjacency matrix and adjacency list to achieve the basic map operations (including map the breadth and depth-first search) (2) to determine whether the connectivity of the graph, the output of the graph the number of connected components (3) the output of a connected component of every minimum spanning tree. Platform: |
Size: 20480 |
Author:李雅芳 |
Hits:
Description: 顶点倒塌（Vertex Collapse）算法中，一开始图中的N个顶点看作N个孤立的超顶点(Super Vertex)，算法运行中，有边连通的超顶点相继合并，直到形成最后的整个连通分量。每个顶点属于且仅属于一个超顶点，超顶点中标号最小者称为该超顶点的根。-Collapsed vertex (Vertex Collapse) algorithm, one began to map the N vertices as N isolated vertices super (Super Vertex), algorithm, there are the super-edge-connected vertices have merged to form the final until the entire connected component . Each vertex belongs to and only belong to one super-vertex, super-vertex in the smallest numbers are referred to as the root of the super-vertex. Platform: |
Size: 2048 |
Author:chj |
Hits:
Description: 求强连通分量，好像只是判断有几个强连通分量的。-Strongly connected component, it seems only a judge has several strongly connected components. Platform: |
Size: 1024 |
Author: |
Hits:
Description: 寻找图像物体的外轮廓，通过Connected component分析实现-Find images of objects outside the contour, through the Connected component analysis to achieve Platform: |
Size: 13312 |
Author:常兰兰 |
Hits:
Description: This program calculates the number of connected components in a graph (Two vertices are in the same connected component of the graph, if there exists a path between these two vertices. Platform: |
Size: 1024 |
Author:prongs |
Hits:
Description: java实现图像连通区域算法
*ImageLabel is an algorithm that applies Connected Component Labeling
*alogrithm to an input image. Only mono images are catered for.-*ImageLabel is an algorithm that applies Connected Component Labeling
*alogrithm to an input image. Only mono images are catered for. Platform: |
Size: 3072 |
Author:程磊 |
Hits:
Description: A rough implementation of "A Component-Labeling Algorithm Using Contour Tracing Technique" paper on an implementation of connected component algorithm using contour tracing, allowing the algorithm to do connected component labelling with just one pass through the image. Platform: |
Size: 1009664 |
Author:Hao Wooi Lim |
Hits:
Description: this useful program for identifying blobs in video stream . called connected component labeling Algo. -this is useful program for identifying blobs in video stream . called connected component labeling Algo. Platform: |
Size: 65536 |
Author:uomhacker |
Hits:
Description: this is very simple connected component algo. we can easily understand this algo as well . Platform: |
Size: 31744 |
Author:uomhacker |
Hits:
Description: 二值图像连通域标记快速算法,能进行区域检测，附代说明文档-Binary image connected component labeling fast algorithm that can detect regional, with a generation of documentation Platform: |
Size: 47104 |
Author:lq8712b3 |
Hits:
Description: Connected component labeling by an Iterative algorithm used for labeling image pixel.It will divide the region according to pixel value. Platform: |
Size: 10240 |
Author:Manish |
Hits:
Search - connected component