搜索资源列表
-
0下载：
有向图的强连通分量算法的java语言实现，-directed graph algorithms strongly connected component of java language.
-
-
0下载：
有向图的强连通的分量的实现-directed graph strongly connected component of the realization
-
-
0下载：
数据结构中的求强连通分量的源程序，用vc6.0来编写-data structure for the strongly connected component of the source used to prepare vc6.0
-
-
0下载：
二值图像连通域标记快速算法,能进行区域检测，附代说明文档，VB开发-Binary image connected component labeling fast algorithm that can detect regional, with a generation of documentation
-
-
0下载：
二值图像连通域标记快速算法,能进行区域检测，附代说明文档-Binary image connected component labeling fast algorithm that can detect regional, with a generation of documentation
-
-
0下载：
求强连通分量，好像只是判断有几个强连通分量的。-Strongly connected component, it seems only a judge has several strongly connected components.
-
-
0下载：
F# Connected Component Union-Find Algorithm from MSDN Developer
-
-
0下载：
克鲁斯卡尔算法(Kruskal s algorithm)是两个经典的最小生成树算法的较为的该算法的代码进行了综合和改进，把各个版本存在的简单理解的一个。本程序对网上的很多版本错误都进行了改正，并用多个例子进行测试。欢迎大家找出错误。-Kruskal s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it
-
-
1下载：
SOM神经网络（自组织特征映射神经网络）是一种无导师神经网路。网络的拓扑结构是由一个输入层与一个输出层构成。输入层的节点数即为输入样本的维数，其中每一节点代表输入样本中的一个分量。输出层节点排列结构是二维阵列。输入层X中的每个节点均与输出层Y每个神经元节点通过一权值(权矢量为W)相连接，这样每个输出层节点均对应于一个连接权矢量。
自组织特征映射的基本原理是，当某类模式输入时，其输出层某一节点得到最大刺激而获胜，获胜节点周围的一些节点因侧向作用也受到较大刺激。这时网络进行一次学习操作，获胜节点
-
-
0下载：
performs connected component labeling and removes noises by using size filter.
-
-
0下载：
Connected component labeling by an Iterative algorithm used for labeling image pixel.It will divide the region according to pixel value.
-
-
0下载：
显示图的邻接矩阵, 图的邻接表, 深度优先遍历, 广度优先遍历, 最小生成树PRIM算法, 最小生成树KRUSCAL算法,图的连通分量-Shows the adjacency matrix, adjacency table, depth-first traversal, breadth-first traversal, minimum spanning tree PRIM algorithm, minimum spanning tree KRUSCAL algorithm, graph conn
-
-
1下载：
主要是连通分量提取及实现,通过matlab实现的了在人脸局部图像中定位嘴的中心.-Mainly connected component extraction and realization, through matlab to achieve in the face of local images to locate the center of the mouth.
-
-
0下载：
The Strongly connected component algorithm. This is my exercise of Introduction to Algorithm subject.
-
-
0下载：
遍历一遍，判断图分为几部分（假定为P部分，即图有 P 个连通分量）,对于每一个连通分量，如果无环则只能是树，即：边数＝结点数－1,只要有一个满足边数>结点数－1,原图就有环.
-Traverse again, the determination map is divided into several parts (assumed to section P, with P in Figure connected component), for each connected compone
-
-
0下载：
求最大团的算法，Bron-Kerbosch 算法计算图的最大全连通分量(团clique)，matlab实现-Seeking maximum clique algorithm, Bron-Kerbosch algorithm to calculate the maximum fully connected graph component (group clique), matlab achieve
-
-
0下载：
The basic steps of the connected-component text extraction algorithm are given below,
and diagrammed in Figure 10. The details are discussed in the following sections.
1. Convert the input image to YUV color space. The luminance(Y) value is used
-
-
0下载：
This matlab program will detect the largest connected component
-
-
0下载：
各种最小生成树算法 最短路径算法 邻接矩阵和邻接表的相互转化 求连通分量的算法-Interconversion of various minimum spanning tree algorithm shortest path algorithm adjacency matrix and adjacency list of requirements connected component algorithm
-
-
0下载：
在MATLAB中求图像纹理特征，MyubDMa参数是一种双隐层反向传播神经网络，可以动态调节运行环境的参数，在matlab环境中自动识别连通区域的大小,JjSnReK条件包括主成分分析、因子分析、贝叶斯分析，采用波束成形技术的BER计算。- In the MATLAB image texture feature, MyubDMa parameter Is a two hidden layer back propagation neural network, Can dynamically ad
-
