搜索资源列表
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)
- 最小生成树问题 问题描述：若要在ｎ个城市之间架设通讯网络，只需要架设ｎ－１条线路即可。如何以最低的经济代价建设这个通讯网，是一个网的最小生成树问题。 设计要求：利用克鲁斯卡尔算法求网的最小生成树；以文本形式输出生成树中各条边以及它们的权值。 -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)
- 最小生成树问题 问题描述：若要在ｎ个城市之间架设通讯网络，只需要架设ｎ－１条线路即可。如何以最低的经济代价建设这个通讯网，是一个网的最小生成树问题。 设计要求：利用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.
m_graph
- Adjacent Matrix 以一個N*N的陣列來表示一個具有N個頂點的圖形 我們以陣列的鎖列值來表示頂點以陣列的內容值來表示頂點間的邊是否存在-Adjacent Matrix with a N* N array to express an N vertex graph, we lock out the array values to express the content of vertex array vertex values to express the existence o
graph
- 图的一系列性质,通过输入图的结点和边,输出图的各种矩阵,并可判断图是否是连通图,欧拉图等性质.-Map a series of nature, by entering the graph nodes and edges, the output map of various matrices, and to determine whether it was connected graph chart, such as the nature of the Euler diagram.
grath
- 用来建立一个图，输入边和权值，可以求得最短路径-Used to set up a map, enter the edges and weights, you can find the shortest path
moving_average_v3.1
- Smooths a matrix (with/without NaN s) via recursive moving average method and eliminates data gaps. -MOVING_AVERAGE(X,F) smooths the vector data X with a boxcar window of size 2F+1, i.e., by means of averaging each element with the F elements at hi
BlobExtraction
- 根据灰度值查找图源上的blob。并找出所有的边界点。-Find BLOBS AND THE EDGES.
redundantpaths
- 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 u
ShortestPaths
- Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges.
ShortestPathsEdge
- In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the sh
EdgeDisjointCycles
- Edge Disjoint Cycles. You are given an input graph that is either directed or undirected. Write a program that reads in a vertex number and lists the number of edge disjoint cycles that start and end at this vertex. The output should also list the ed
EDGE_SOBER
- The program is used to detect the edges of the image using Sobel method.
EDGE_LAPLASS
- This program is used to detect the edges of the image using Laplass method.
Canny_method
- I think some of the edges aren t getting detected becuase of the sobel filters not catching the edges, but I m not sure. I think the thick lines are from not doing the supression and hysteresis properly. Here is my canny edge code and convolution
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.