Location:
Search - connected
Search list
Description: 有向图的强连通的分量的实现-directed graph strongly connected component of the realization
Platform: |
Size: 2048 |
Author: 张冰 |
Hits:
Description: 数据结构中的求强连通分量的源程序，用vc6.0来编写-data structure for the strongly connected component of the source used to prepare vc6.0
Platform: |
Size: 1024 |
Author: 叶芦芦 |
Hits:
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: 使用C语言通过OCI方式连接 ORACLE-use C language through OCI connected ORACLE
Platform: |
Size: 4096 |
Author: 鲍勃 |
Hits:
Description: 有向图的强连通分量算法的java语言实现，-directed graph algorithms strongly connected component of java language.
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: 求有向图的强连通分量，使用2次dfs的算法，具体名字我也忘掉了-Order to have a strongly connected directed graph component, the use of 2 dfs algorithm, the specific name I have forgotten
Platform: |
Size: 2048 |
Author: zzq |
Hits:
Description: 用java语言深度优先回溯法实现有向图的强连通分量-Using java language backtracking depth-first to achieve directed graph strongly connected component
Platform: |
Size: 2048 |
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: 在IDL开发平台下，对一个栅格数组(2维矩阵)的连通性进行求掩码，将连通的同一个数的所有相邻数据全部以一个自增的掩码标识出来，并且自动识别和标出对孤岛，可以指定需要计算的有效值或者不需要计算的无效值。-In IDL under development platform for a grid array (2-dimensional matrix) for connectivity to mask, the same number will be connected all the data in all adjacent to a self-marked by the mask, and automatic identification and marked on the island, you can specify the need to calculate the RMS or do not need to calculate the invalid value.
Platform: |
Size: 1024 |
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: 輕易學好C++編程技巧 - 進楷 (香港科技大學筆記 19課) 內容包括
1) base C++ review,
2) Pointers and Dynamic Objects,
3) Recursion,Linked Lists,
4) Stacks and Queues,
5) Algorithm Analysis,
6) Insertion Sort and Mergesort,
7) Quicksort,
8) Heaps and Heapsort,
9) Lower Bound of Sorting and Radix Sort,
10) Binary Trees and Binary Search Trees
11) AVL Trees,
12) B+ Trees
13) Graphs and Breadth-First Search
14) Depth-First Search
15) Connected Components, Directed Graphs,
16) Topological Sort
17) Hashing
18) Pattern Matching
19) Additional Review
-Easily learn C++ Programming skills- Jin Kai (Hong Kong University of Science and Technology Division notes 19) will include 1) base C++ Review, 2) Pointers and Dynamic Objects, 3) Recursion, Linked Lists, 4) Stacks and Queues , 5) Algorithm Analysis, 6) Insertion Sort and Mergesort, 7) Quicksort, 8) Heaps and Heapsort, 9) Lower Bound of Sorting and Radix Sort, 10) Binary Trees and Binary Search Trees 11) AVL Trees, 12) B+ Trees 13) Graphs and Breadth-First Search 14) Depth-First Search 15) Connected Components, Directed Graphs, 16) Topological Sort 17) Hashing18) Pattern Matching 19) Additional Review
Platform: |
Size: 3751936 |
Author: chan kindfish |
Hits:
Description: 八值图像连通区域标记，为每个连通区域分配一个唯一的标号，处理后的图像按照从左到右，从上到下的顺序获得连续的标号-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 to bottom order of access to continuous labeling
Platform: |
Size: 2048 |
Author: zhangjing |
Hits:
Description: Connected Component Labeling
Platform: |
Size: 12288 |
Author: 李恆寬 |
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: 一种实时高速的八连通区域填充算法，用于连通区域的参考学习-A real-time high-speed eight-connected region filling algorithm for the connectivity of regional reference learning
Platform: |
Size: 258048 |
Author: zhaow666 |
Hits:
Description: 金立手机连接PC的工具，有金立手机又不好软件的朋友请下载-Gionee connected PC, mobile phone tools, mobile phone also has Gionee bad software download Friend Requests
Platform: |
Size: 2525184 |
Author: |
Hits:
Description: 新型的单相光伏并网发电装置The new single-phase grid-connected PV installations-The new single-phase grid-connected PV installations
Platform: |
Size: 335872 |
Author: peak3210 |
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:
« 12
3
4
5
6
7
8
9
10
...
50
»