搜索资源列表
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
TransparentButtonDemo
- Bob Carboni写的使用透明度、抗锯齿波、窗口区域等技术的按钮控件。Transparent Button with Region and Anti-Aliased Edges-Bob Carboni was the use of transparency, anti-aliasing wave technologies such as the window region of the button control. Transparent Button with Region and An
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
Wavelet
- Multiscales Edges Detection Based On Bubble Wavelet
2
- 设计一个三角形类，包含表示三条边的数据成员，编程实现求两个三角形面积之和。-The design of a triangle, are contained, said three edges of the data members, programming for area and two triangles.
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.
DDR_SDRAM_controller
- DDR SDRAM控制器的VHDL源代码，含详细设计文档。 The DDR, DCM, and SelectI/O™ features in the Virtex™ -II architecture make it the perfect choice for implementing a controller of a Double Data Rate (DDR) SDRAM. The Digital Clock Manager (DCM) provides t
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
SCC
- Java实现的图的强连通分支算法，可以输入图的节点和边，并返回图中所有的强连通分支-Java to achieve strong connectivity of the graph branch algorithm, can enter graph nodes and edges, and return to map all of the strongly connected branch
BC
- Java实现的双连通分支算法，可以自行输入图的节点和边，并返回图中所有的双连通分支-Java connectivity to achieve the two-branch algorithm, can enter the graph nodes and edges, and return to map all of the dual-branch connectivity
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
pacman
- its a cool game that breaks the screen on the edges if you break ur screen fucking cool -its a cool game that breaks the screen on the edges if you break ur screen fucking cool haha
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.