Description: Computes "Connected Components" using Tarjan s Union-Find algorithm the result is returned in the same buffer as gray_level image with values equal to the label of the component. Platform: |
Size: 3072 |
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: 求强连通分量，好像只是判断有几个强连通分量的。-Strongly connected component, it seems only a judge has several strongly connected components. Platform: |
Size: 1024 |
Author: |
Hits:
Description: ACM题解：The Bottom of a Graph 求图的强连通分量的好例子-ACM problem solution: The Bottom of a Graph a good example of graph of strongly connected components Platform: |
Size: 529408 |
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: Strongly Connected Component Library to obtaion strongly connected components of a graph, for PC platforms writeen in Visual C-Strongly Connected Component Library to obtaion strongly connected components of a graph, for PC platforms writeen in Visual C++ Platform: |
Size: 58368 |
Author:Orhan Ucar |
Hits:
Description: Implementation Of Labeling Connected Components
用C#实现图像的连通区域标定，可选4连通，8连通-Implementation Of Labeling Connected Components
The algorithm is coded in C# using unsafe so the quality and speed of the program may not be affected. The class BitmapData is used to read and process the pixels in the image. This is the specialty of C# to provide such a speed even on image processing applications. There is a set of modules that are designed to implement the algorithm. The program scans the image to convert the image into grayscale Levels. Then it converts the image into binary. This binary image will be subjected to splitting it into components. Here we can us 4-Connected or 8-Connected Algorithm but we used 8-Connected Algorithm for finding the Blobs in the image as described above Platform: |
Size: 53248 |
Author:程磊 |
Hits:
Description: 图论部分的MPI源码，包括传递闭包、连通分量、最短路径和最小生成树，附带说明和测试用例-Graph Theory part of the MPI source code, including the transitive closure, connected components, shortest path and minimum spanning tree, with instructions and test cases Platform: |
Size: 738304 |
Author:不死鸟 |
Hits:
Description: 查找连通分量的个数，
本程序的例子是查找一个图片中细胞的个数。-use openCV to find the number of connected components.
This example is to find the number of cells in a picture. Platform: |
Size: 93184 |
Author:蓝色加冰 |
Hits:
Description: java实现，寻找强连通分支算法，Eclipse下可以直接打开工程-java implementation algorithm to find strongly connected components, Eclipse can open the project under Platform: |
Size: 8192 |
Author:尹文昊 |
Hits:
Description: 本程序是基于多文档(MDI)的连通域标记算法，用于统计连通域的数目。本人亲自修改，运行通过，而且附有测试例图。-This procedure is based on the multiple document (MDI) of the connected components labeling algorithm, the number of connected components for the statistics. I personally modify, run through, and with a test case diagrams. Platform: |
Size: 2087936 |
Author:jerry |
Hits:
Description: 此代码是基于数据结构算法分析的代码，用到图论中的深度优先收索法来求连通分支的问题，只要给出顶点、边数和相应的边就可以求出连通分支的数目-This code is based on the analysis of the code of the data structure algorithms used in graph theory depth-first closing cable method, as long as the given vertex connectivity of the branch, the number of edges and the corresponding side you can find the number of connected components Platform: |
Size: 1024 |
Author:韦龙 |
Hits:
Description: 图像处理，基于利用数字形态学数连通区的方式判断图像信息（数图中有几个瓶子），matlab，确保可用-Image processing, based on the use of digital morphology of the number of connected components of the image to determine the image information (a few bottles in the number), MATLAB, to ensure that the Platform: |
Size: 16384 |
Author:许平 |
Hits:
Description: Connected-component labeling (alternatively connected-component analysis, blob extraction, region labeling, blob discovery, or region extraction) is an algorithmic application of graph theory, where subsets of connected components are uniquely labeled based on a given heuristic. Connected-component labeling is not to be confused with segmentation.
This code is used to separate the connected components in the image. Platform: |
Size: 28672 |
Author:ahmed |
Hits:
Search - Connected Components