搜索资源列表
SUSAN
- SUSAN算子检测图像边缘和角点,可以自己定义不同的检测模板,实现不同功能的角点检测。-SUSAN operator detect image edges and corners, can define a different template to different functions of the corner detection.
612109301
- 要求采用邻接矩阵作为无向图的存储结构,邻接表作为有向图的存储结构,完成无向图和有向图的建立,并对建立好的图进行深度和广度优先遍历。具体实现要求: 1. 通过键盘输入图的顶点和边信息,分别构造一个无向图的邻接矩阵和一个有向图的邻接表。 2. 分别对建立好的两个图进行深度和广度优先遍历,输出相应的遍历序列。 3. 统计两个图的连通分量的个数。 -Require the use of adjacency matrix as the storage structure of an und
3352
- poj3352给一个图,求出需要加最少的边使去掉任一条边,图都连通.割点的应用-poj3352 to a map, obtained at least the need to remove the edges so that any one side, map are connected. cut-point application
prim
- (1)利用普里姆算法求网的最小生成树 (2)实现教科书中定义的抽象数据类型mfset。以此表示构造生成树过 程中的连通分量。 (3)以文本形式输出生成树中各条边以及他们的权值-(1) the use of prim algorithm for minimum spanning tree network (2) the realization of the textbook definition of abstract data types mfset. Spanning tree s
DijkstraTest
- Dijkstra算法及demo实现,目前10万点,20条边,平均搜索时间为3.7秒.-Dijkstra algorithm and the realization demo now 100,000 points, 20 edges, the average search time of 3.7 seconds.
btree
- Trees are natural structures for representing certain kinds of hierarchical data. A (rooted) tree consists of a set of nodes (or vertices) and a set of arcs (or edges). -Trees are natural structures for representing certain kinds of hierarchical data
xyk
- 由键盘输入多边形的边数,求其内角和,可以用逐个数字进行试用。-Keyboard input from a number of polygon edges, and its angle and can be used by the figures for trial.
Minium_Spanning_Tree(Kruskal)
- 最小生成树问题 问题描述:若要在n个城市之间架设通讯网络,只需要架设n-1条线路即可。如何以最低的经济代价建设这个通讯网,是一个网的最小生成树问题。 设计要求:利用克鲁斯卡尔算法求网的最小生成树;以文本形式输出生成树中各条边以及它们的权值。 -The issue of minimum spanning tree problem Descr iption: n To set up a communication network between cities, only need to
minimal_spanning_tree(Prims)
- 最小生成树问题 问题描述:若要在n个城市之间架设通讯网络,只需要架设n-1条线路即可。如何以最低的经济代价建设这个通讯网,是一个网的最小生成树问题。 设计要求:利用Prims算法求网的最小生成树;以文本形式输出生成树中各条边以及它们的权值。 -The issue of minimum spanning tree problem Descr iption: n To set up a communication network between cities, only need to
Ver3_0_source
- A tutorial and open source code for finding edges and corners based on the filters used in primary visual cortex.
grath
- 用来建立一个图,输入边和权值,可以求得最短路径-Used to set up a map, enter the edges and weights, you can find the shortest path
HARTLEY.ZIP
- The frequency domain plays an important role in image processing to smooth, enhance, and detect edges of images. Although image data typically does not include imaginary values, the fast Fourier transform (FFT) has been used for obtaining spect
draw-tree
- 伸展树,基本数据结构,The tree is drawn in such a way that both of the edges down from a node are the same length. This length is the minimum such that the two subtrees are separated by at least two blanks.-The tree is drawn in such a way that both of the edges
Hough
- Hough变换 使用matlab随机函数,计算输入图像的Hough变换。-Hough Transform.Use matlab s radon function to compute the hough transform.or threshold its edges.
automatic-classification-cluster
- 一、问题描述若要在n个城市之间建役通信网络,只福要架设n-1条级路即可.如何以最低的经济代价建设这个通信网,是一个网的最小生成树问题。二、基本要求 (1)利用克鲁斯卡尔算法求图的最小生成树。 (2)能实现教科书6.5节中定义的抽象数据类型MFSet.以此表示构造生成树过程中的连通分量。 (3 ) 以文本形式输出生成树中各条边以及他们的权值.三、需求分析 1、构造图结构。 2、利用克鲁斯卡尔算法求图的最小生成树。 3、完成生成树的输出。 -I. Descr iption of the proble
RoutingSystem
- The task in this assignment is to implement an airline routing system. Your system should be able to read in a ight network as a graph from a le, where airports are represented as vertices and ights between airports are represented as ed
HoughTransformconsole
- Using opencv, Hough Transformation extract lines from edges.
Kruskal
- 克鲁斯卡尔算法思想.cpp int seekedge(EDGE * (&a), int n) void bubble(EDGE * (&a), int size) void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针,a2是最小生成树边集的头指针,k为所要删的边 void storepicture(EDGE * (&a), int n, VERTEX *b, int m) -Thinking of Kruskal algor
Kruskal
- 本文件是数据结构中很重要的一个图的Kruskal算法。Kruskal算法每次选择n- 1条边,所使用的贪婪准则是:从剩下的边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。将文件编译,可完成Kruskal算法-This document is a very important data structure of a graph algorithm of Kruskal. Kruskal algorithm for each choice of n-1 edges, the gre
canny
- Canny for find edges in a image. Work fine.