Location:
Search - depth edge
Search list
Description: The Linux Network Administrator s Guide, Third Edition updates a classic Linux title from O Reilly. This refreshed resource takes an in-depth look at everything you need to know to join a network. Topics covered include all of the essential networking software that comes with the Linux operating system, plus information on a host of cutting-edge services including wireless hubs, spam filtering, and more-The Linux Network Administrator's Guide. Third Edition updates a classic title fro Linux m O Reilly. This refreshed resource takes an in - depth look at everything you need to know to join a network. Topics covered include all of the ess ential networking software that comes with the Linux operating system, plus information on a host of cutting-edge serv ices including wireless hubs. spam filtering, and more
Platform: |
Size: 1117248 |
Author: 丁绍洁 |
Hits:
Description: The Linux Network Administrator s Guide, Third Edition updates a classic Linux title from O Reilly. This refreshed resource takes an in-depth look at everything you need to know to join a network. Topics covered include all of the essential networking software that comes with the Linux operating system, plus information on a host of cutting-edge services including wireless hubs, spam filtering, and more-The Linux Network Administrator's Guide. Third Edition updates a classic title fro Linux m O Reilly. This refreshed resource takes an in- depth look at everything you need to know to join a network. Topics covered include all of the ess ential networking software that comes with the Linux operating system, plus information on a host of cutting-edge serv ices including wireless hubs. spam filtering, and more
Platform: |
Size: 1117184 |
Author: 丁绍洁 |
Hits:
Description: 1.首先选定图的类别（有向图、无向图），再选定图的存储结构，根据输入的顶点或者边建立图；并把相应的邻接表或者邻接矩阵输出；
2.根据已有的邻接矩阵或邻接表用递归方法编写深度优先搜索遍历算法，并输出遍历结果；
-1. First of all selected map type (directed graph, undirected graph), re-selected map storage structure, under the Importation of the establishment of the vertex or edge map and the corresponding adjacency list or adjacency matrix output 2. According to Some adjacency matrix or adjacency list prepared by the recursive depth-first search method traversal algorithm, and output traversal results
Platform: |
Size: 1024 |
Author: 异元 |
Hits:
Description: 一、 程序分析
1． 以邻接多重表为存储结构，实现连通或非连通的无向图的深度优先与广度优先遍历。
2． 设图的结点不超过30个，每个结点用一个编号表示。通过输入图的边输入一个图，每条边为一个数对。
3． 问题描述：
4． 以第一个结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边。
-First, program analysis 1. To the adjacent multi-table for the storage structure, to achieve connectivity and non-connected undirected graph with a depth-first breadth-first traversal. 2. Node-based map is not more than 30, each node with a number that. Map by entering the input side of a graph, and each side for a few right. 3. Problem Description: 4. To the first node as a starting point, respectively, under the output of each node traversal visit sequences and the corresponding spanning tree edge.
Platform: |
Size: 19456 |
Author: 姚晶晶 |
Hits:
Description: 构造一个有向图或无向图，选用一种存储结构，分别输出其深度优先和广度优先的结果。
先按自己的意图画出一个顶点不少于8个、边不少于6条的有向图或无向图，用邻接矩阵或邻接表的存储结构，输入图的顶点信息和边的信息，然后调用深度优先和广度优先搜索算法，看结果是否正确。
-Construct a directed graph or undirected graph, choose a storage structure, respectively, the output of its depth-first and breadth-first results. To their own intention to draw a point of not less than eight, edge not less than six of the directed graph or undirected graph with adjacency matrix or adjacency list of the storage structure, type map information and the edge of vertex information, and then call the depth-first and breadth first search algorithm to see the results are correct.
Platform: |
Size: 83968 |
Author: pujianjun |
Hits:
Description: 实现连通无向图的深度优先和广度优先遍历以用户指定的结点为起点分别输出每种遍历下的结点访问序列和相应生成树的边集。-Undirected graph connectivity realize the depth and breadth-first traversal of priority to user-specified node as a starting point, respectively, under the output of each node traversal visit sequences and the corresponding spanning tree of the edge set.
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 利用C语言实现数据结构中的图的建立,根据边的数目建立图,并用深度遍历法遍历图等-The use of C language data structure diagram of the establishment, in accordance with the number of edge-building plans, and the depth of traversal method traverse map
Platform: |
Size: 1024 |
Author: chen ming |
Hits:
Description: 使用Verilog编写的同步FIFO，可通过设置程序中的DEPTH设置FIFO的深度，FIFO_WRITE_CLOCK上升沿向FIFO中写入数据，
FIFO_READ_CLOCK上升沿读取数据。本程序对FIFO上层操作简单实用。-Prepared by the use of Verilog synchronous FIFO, through the setup program in the FIFO depth DEPTH settings, FIFO_WRITE_CLOCK rising edge to the FIFO write data, FIFO_READ_CLOCK rising edge of read data. This procedure on the upper FIFO operation simple and practical.
Platform: |
Size: 1024 |
Author: 张键 |
Hits:
Description: c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
Platform: |
Size: 2048 |
Author: jazz |
Hits:
Description: As you develop your skills in C++, it becomes increasingly important to separate essential information from hype and glitz, and to find the in-depth content you need in order to grow. The C++ In-Depth Series provides the tools, concepts, techniques, and new approaches to C++ that will give you a critical edge.-As you develop your skills in C++, it becomes increasingly important to separate essential information from hype and glitz, and to find the in-depth content you need in order to grow. The C++ In-Depth Series provides the tools, concepts, techniques, and new approaches to C++ that will give you a critical edge.
Platform: |
Size: 1098752 |
Author: Thu |
Hits:
Description: 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出各种遍历下的结点访问序列和相应生成树的边集-To the adjacent multi-table for the storage structure, to achieve connectivity of undirected graph depth-first and breadth-first traversal. To user-specified node as a starting point, respectively, the output under a variety of traversal sequence of nodes visited and the corresponding spanning tree of the edge set
Platform: |
Size: 12288 |
Author: xu |
Hits:
Description: code for depth edge detection algorithm
Platform: |
Size: 1024 |
Author: ram |
Hits:
Description: 深度优先搜索所遵循的搜索策略是尽可能“深”地搜索图。在深度优先搜索中，对于最新发现的结点，如果它还有以此为起点而未搜过的边，就沿着边继续搜索下 去。当结点v的所有边都已被探寻过，搜索将回溯到发现结点v有那条边的始结点。这一过程一直进行到已发现从源结点可达的所有结点为止。如果还存在未被发现 的结点，则选择其中一个作为源结点并重复以上过程，整个过程反复进行直到所有结点都被发现为止-Followed by depth-first search strategy is to search " Shenzhen" to search for plans. In depth-first search for the newly discovered node, if it has not found this as a starting point over the edge, along the edge to continue the search indefinitely. When node v all edges have been searching for, the search will go back to the node v has found that the only edge nodes. This process has been carried out to have been found up from the source node until all nodes. If there are still undiscovered node, then choose one node as the source and repeat the above process, the whole process repeated until all nodes have been found so far
Platform: |
Size: 12288 |
Author: 文 |
Hits:
Description: As you develop your skills in C++, it becomes increasingly important to separate essential
information from hype and glitz, and to find the in-depth content you need in order to grow.
The C++ In-Depth Series provides the tools, concepts, techniques, and new approaches to
C++ that will give you a critical edge.
Platform: |
Size: 1793024 |
Author: atom |
Hits:
Description: 深度搜索，可将边缘断点连接起来，多用于图像分割中和边缘检测结合使用-Depth of search, could be the edge connecting the breakpoints are used for image segmentation and edge detection used in conjunction
Platform: |
Size: 1024 |
Author: shenyong |
Hits:
Description: 1. 用ＤＦＳ判断一个无向图是否是连通图；
2. 为有向图的边分类，将它们的边分为前向边、后向边和交叉边；
3. 用ＤＦＳ和点消除求有向图的拓扑排序；
4. 判断有向图是不是强连通图，若不是，求强连通分量；
5. 判断有向图是不是半连同图；
6. 判断有向图是不是单连通图；
7. 判断无向图是不是双连通图。
通过以上编程对ＤＦＳ的应用，进一步了解ＤＦＳ的算法及它所代表的算法思想。
-1. Using DFS to test if a given undirected graph is connected or not.
2. Classify the edges of a directed graph into tree edges, back edges, forward edges or cross edges by a depth-first traversal of the graph. If the given graph is undirected, classify the edges into tree edges and back edges. And verify if a directed or undirected graph has a cycle.
3. Compute the topological order of a directed graph using both DFS algorithm and source removal algorithm.
4. A strongly connected graph is a directed graph with every pair of vertices reachable from each other. A strongly connected component C of a directed graph G is a subset of maximal vertices such that every pair of vertices in the subset are reachable from each other. A strongly connected component graph GSCC of a graph G is a directed graph that each component C of G is considered as a single vertex in GSCC and there is an edge between components C1 and C2 if there exist an edge (u, v) in the graph G with u belongs to C1 and v
Platform: |
Size: 10240 |
Author: 卢竹江 |
Hits:
Description: Edge detection
We propose a edge detection framework that takes as its input a xation (a point
location) in the scene and outputs the region containing that xation. The xated
region is segmented in terms of the area enclosed by the \optimal" closed boundary
around the xation using the probabilistic boundary edge map of the scene (or image).
The probabilistic boundary edge map, which is generated by using all available visual
cues, contains the probability of an edge pixel being at an object (or depth) boundary
Platform: |
Size: 387072 |
Author: robin |
Hits:
Description: datasets for edge detection
Platform: |
Size: 1796096 |
Author: param |
Hits:
Description: We develop a new edge detection algorithm, holistically-nested edge detection (HED), which performs image-to-image prediction by means of a deep learning model that leverages fully convolutional neural networks and deeply-supervised nets. HED automatically learns rich hierarchical representations (guided by deep supervision on side responses) that are important in order to resolve the challenging ambiguity in edge and object boundary detection. We significantly advance the state-of-the-art on the BSD500 dataset (ODS F-score of .790) and the NYU Depth dataset (ODS F-score of .746), and do so with an improved speed (0.4s per image).
Platform: |
Size: 2545664 |
Author: 穿山甲说
|
Hits:
Description: 反锐化掩膜技术(Unsharp Masking,UM)又称为模糊蒙片处理，是一种经典的图像边缘增强算法，提高图像的高频分量部分来增强其视觉效果[18,19].反锐化掩模技术最早是应用于摄影技术中，以增强图像的边缘和细节。光学上的操作方法是将聚焦的正片和散焦的负片在底片上进行叠加，结果是增强了正片高频成份，从而增强了轮廓，散焦的负片相当于“模糊”模板（掩模），它与锐化的作用正好相反，因此，该方法被称为反锐化掩模法。(The sharpenmembrane Technology (Unsharp Masking UM) is also called fuzzy mask processing, is a classical algorithm of image edge enhancement, to enhance the visual effect of [18,19]. unsharp masking technology was first used in photography to improve the high frequency components of the image, to enhance the image edge and details. The operation method is to focus on optical negative positives and defocus are superimposed on the film, the result is the enhancement of the high frequency component of positive, so as to enhance the contours of negative defocus equivalent to "fuzzy" template (mask), and sharpening the opposite effect, therefore, this method is called unsharp masking method.)
Platform: |
Size: 1796096 |
Author: 小懒猫 |
Hits: