搜索资源列表
exp6
- 合肥工业大学数据结构试验六图结构试验 包括完整的实验要求、实验预习报告、实验最终报告 实验要求： <1>求给定图中的边（或弧）的数目。 <2>求解出从给定顶点到所有顶点的最短路径（以边数计算）。 <3>判断一个有向图g是否是一棵有向树。（任意一个顶点可能是根） <4>对给定的图G及出发点v0，设计算法从V0出发深度遍历图G，并构造出相应的生成树。 -Hefei University of testing six graph
edges_demo
- edges demo-edges demo
edge_detection
- Edge detection is a feature of this Code and you can find out the edges of an image seamelessly using matlab by this code
AComputationalApproachtoEdgeDetection
- canny边缘检测经典算法，在学校数据库下的-a paper about the detection of edges invented by canny,downloaded from the school database
XGraph2
- 能够建立有向图无向图的邻接矩阵和邻接表表示法，深度优先和广度优先搜索，能够存储和显示相应的搜索结果（深度优先或广度优先生成森林（或生成树）、深度优先或广度优先序列和编号）。以文件形式输入图的顶点和边，并显示相应的结果。-To build a directed graph undirected adjacency matrix and adjacency list representation, depth-first and breadth-first search, to store and
canny
- Canny算子可有效的检测图像的边缘，得到较为清晰，较为准确的边缘。-Canny operator can effectively detect the edges of the image to get a more clear, more precise edges.
New_Compressed_(zipped)_Folder
- 有效的进行图像边缘的路径追踪，完成图像边缘的完善。-Effectively track the path of the image edge, the improvement of image edges.
pic
- 对任意给定的图（顶点数和边数自定），建立它的邻接表并输出，然后利用堆栈的五种基本运算（清空堆栈、压栈、弹出、取栈顶元素、判栈空）实现图的深度优先搜索遍历和广度优先搜索遍历算法。 -For any given graph (vertices and edges from the set), to establish its adjacency list and output, and then use the stack of five basic operations (empty stac
Manhattan
- 在 VLSI 设计中,多点互连是物理设计阶段的关键问题之一,而互连的点数等于 2 或大于 2 分别对应于 Manhattan 空间上有障碍时的最短路径问题和最小 Steiner 树问题,显然前者是后者的基础.连接图是研究最短路径 问题的有效工具,已有的典型连接图包括基于轨迹的GC 和GT 以及基于自由区的GF 和GG.工作包括3个方面:设计并分析了在各种连接图上实现动态的点对之间的最短路径查询算法 分析了在各个连接图上构造 3-Steiner 树的算 法,对于已有的 GC 上的 3-
Training-User-Patterns
- You may wish to edit your newly created pattern before launching the OCR process. An incorrectly trained pattern may adversely affect OCR quality. A pattern should contain only whole characters or ligatures. Characters with cut edges and characters w
Edge_DEtection
- Edge detection is one of the most commonly used operations in image analysis, and there are probably more algorithms in the literature for enhancing and detecting edges than any other single subject. The reason for this that edges form the out
Various_EdgeDetection
- Edge detection refers to the process of identifying and locating sharp discontinuities in an image. The discontinuities are abrupt changes in pixel intensity which characterize boundaries of objects in a scene. Classical methods of edge detection inv
alttf23
- ALLEGTTF is a collection of functions to produce anti-aliased text output and TTF (True Type Font) loader, a GRX font loader and a bitmap font loader for use with Allegro. Antialiased text means that fonts have soft edges and blend into their backgro
ndnanfilter
- NDNANFILTER N维零相位数字滤波器，忽略NaN的。 短语法： [年，钨] = ndnanfilter（十，HWIN，女） 短输入： X - 有/无NaN的多维数据。 HWIN - 窗口的名称（默认情况下移动平均的Nd： rectwin ）。 的F - 向量指定为每个维窗口半宽度。 短暂输出： Ÿ - 过滤/平滑X数据与零相移（如X!一样大小）。 W - N维是通过一种特殊的子函数生成的中心对称的窗口称为
7e2e8454dbc4
- detection of edges and segmenting the images
faraday1
- 这个例子显示了如何使用stretchmesh功能 扩大不增加人数的gridpoints在边缘计算窗口的大小。 -This example shows how to use the stretchmesh function to expand the size of the computation window at the edges without increasing the number of gridpoints.
edgedetect
- these codes can be used to detect edges in an image
imagdetect
- 学习matlab图像处理的绝对有用的程序，所有程序均调试通过，程序代码说明 P0401：用Prewitt算子检测图像的边缘 P0402：用不同σ值的LoG算子检测图像的边缘 P0403：用Canny算子检测图像的边缘 P0404：图像的阈值分割 P0405：用水线阈值法分割图像 P0406：对矩阵进行四叉树分解 P0407：将图像分为文字和非文字的两个类别 P0408：形态学梯度检测二值图像的边缘 P0409：形态学实例——从PCB图像中删除所有电流线，仅保留
tiduruihua
- 梯度锐化，将图像边缘部分提取出来，获得图像轮廓，预处理-Gradient sharpening, extracted from the image edges to obtain the image profile, pre-
Graph
- Graph builder. Create vertices and edges.