搜索资源列表
zb2
- 有向图的强连通的分量的实现-directed graph strongly connected component of the realization
sgraph
- 数据结构中的求强连通分量的源程序，用vc6.0来编写-data structure for the strongly connected component of the source used to prepare vc6.0
连通成份分析
- 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.
oci
- 使用C语言通过OCI方式连接 ORACLE-use C language through OCI connected ORACLE
GraphCC
- 有向图的强连通分量算法的java语言实现，-directed graph algorithms strongly connected component of java language.
scc
- 递归算法求一个有向图的强连通分量，输入格式如压缩包中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
StrongComent
- 求有向图的强连通分量，使用2次dfs的算法，具体名字我也忘掉了-Order to have a strongly connected directed graph component, the use of 2 dfs algorithm, the specific name I have forgotten
depthFirstDigraph
- 用java语言深度优先回溯法实现有向图的强连通分量-Using java language backtracking depth-first to achieve directed graph strongly connected component
graph
- 实现了图的主要操作:（1）分别用邻接矩阵和邻接表实现图的基本操作（包括图的广度和深度优先搜索）；(2）判断该图是否连通，输出该图的连通分量数目；（3）输出一个每一个连通分量的最小生成树。-The main achievement of the plan steps: (1), respectively, with adjacency matrix and adjacency list to achieve the basic map o
ConArea
- 在IDL开发平台下，对一个栅格数组(2维矩阵)的连通性进行求掩码，将连通的同一个数的所有相邻数据全部以一个自增的掩码标识出来，并且自动识别和标出对孤岛，可以指定需要计算的有效值或者不需要计算的无效值。-In IDL under development platform for a grid array (2-dimensional matrix) for connectivity to mask, the same number wil
connect
- 顶点倒塌（Vertex Collapse）算法中，一开始图中的N个顶点看作N个孤立的超顶点(Super Vertex)，算法运行中，有边连通的超顶点相继合并，直到形成最后的整个连通分量。每个顶点属于且仅属于一个超顶点，超顶点中标号最小者称为该超顶点的根。-Collapsed vertex (Vertex Collapse) algorithm, one began to map the N vertices as N isolated
lable_parallel
- 八值图像连通区域标记，为每个连通区域分配一个唯一的标号，处理后的图像按照从左到右，从上到下的顺序获得连续的标号-Binary image connected region eight marks, for each connected region a unique label distribution deal with in accordance with the image from left to right, from top
ccl
- Connected Component Labeling
Cpp1
- 求强连通分量，好像只是判断有几个强连通分量的。-Strongly connected component, it seems only a judge has several strongly connected components.
basic_image_processing
- 寻找图像物体的外轮廓，通过Connected component分析实现-Find images of objects outside the contour, through the Connected component analysis to achieve
aaa
- 一种实时高速的八连通区域填充算法，用于连通区域的参考学习-A real-time high-speed eight-connected region filling algorithm for the connectivity of regional reference learning
PhoneSuite_MTK_JLS_V1.1
- 金立手机连接PC的工具，有金立手机又不好软件的朋友请下载-Gionee connected PC, mobile phone tools, mobile phone also has Gionee bad software download Friend Requests
TheBottomofaGraph.tar
- ACM题解：The Bottom of a Graph 求图的强连通分量的好例子-ACM problem solution: The Bottom of a Graph a good example of graph of strongly connected components
The-new-single-phase-grid-connected-PV-installatio
- 新型的单相光伏并网发电装置The new single-phase grid-connected PV installations-The new single-phase grid-connected PV installations
Connected-component-labelling-by-an-Iterative-alg
- Connected component labeling by an Iterative algorithm used for labeling image pixel.It will divide the region according to pixel value.