搜索资源列表
Susan_Edge_Detection_Algorithm_Code
- Susan图像边缘检测算法，定位准确，对多个区域的结点也能精确检测。-Susan Edge Detection Algorithm, accurate positioning of a number of regional nodes can be accurately detected.
quyu
- 使用四邻节点填充实例多边形内部区域。一个简单的填充实例-Neighborhood filled with examples of the use of nodes within the region polygon. Fill a simple example
robot
- 使用OpenGL创建的带关节的机器人手臂旋转程序，这个手臂在肩、肘或其他关节处由节点进行连接-The use of OpenGL to create a robotic arm with a rotating joint program, the arm at the shoulder, elbow or other joints of nodes connected
searchnearestnode
- 程序实现给定平面上N个点的坐标，找出距离最近的两个点.程序中是两种方法寻找最近点对。解法一的时间复杂度是O(N^2)解法二的时间复杂度是（N*lg2/lgN)第二种方法较第一种方法在一维情况下，时间复杂度改进了不少。但是这个方法不能推广到二维的情况，因为距离最近的点对不能保证是影射到某条直线之后紧靠着的两个点。-the procedure can realize the Coordinate which have N nodes ,find the nearest distance betwee
IEEE_ExtremePrograming_2010_D
- This question was asked in IEEE Extreme Programming 2010. Its a graph problem, that the nodes with minimum cost should be followed.
stylize
- 图像风格化处理：在输入图像上设置网格, 在网格结点上生成长度, 宽度变化的笔刷, 利用网格节点所在图像位置上的颜色加上随机扰动, 把输入图像绘制成具有某种艺术风格的图像。-Image processing style: set in the input image grid, the grid nodes generate the length, width change brush, using the position grid nodes where the color of the im
tu
- 这个程序是为了实现图，具体是用来实现图的实现，输入顶点和节点即可-This program is to achieve plans, specific plans are used to achieve the realization of the input vertices and nodes can be
mintree
- 一个有 n 个结点的连通图的生成树是原图的极小连通子图，且包含原图中的所有 n 个结点，并且有保持图联通的最少的边。-An n-node connected graph of the minimal spanning tree is the original connected subgraph, and contains all the n original nodes, and there are plans to maintain at least the edge of Unicom.
vrml
- vrml贴图，简单的贴图和基本纹理，涵盖基本的节点和基本的属性设置，对于新手有一定的帮助-vrml texture, simple and basic texture map, covering the basic attributes of nodes and the basic setup, there is some help for novice
detects-damaged-grids
- 利用角点检测能提取网格图像的节点，并对破损的节点进行自动检测，识别破损节点所在的行数和列数，很适合检测栅栏的破损程度-Corner detection can be extracted using the image grid nodes, and automatically detects damaged nodes, where nodes identify the damaged rows and columns, it is suitable for detecting the exte
GraphNodeDistancesDistribution
- For each pair of nodes, computes the relative hierarchy based on the ratio of their betweenness and degr-For each pair of nodes, computes the relative hierarchy based on the ratio of their betweenness and degree
dijkstra
- 图论算法，计算最短距离.描述了一个节点到其他节点的最短距离-graph theory.it include a algorithm of dijkstra.it display the min path between a node to any other nodes
Euler-circuit
- 欧拉回路，用于图论中的欧拉回求解，最大支持100个节点-Euler circuit for Euler graph theory back solving, maximum support 100 nodes
shenjingwan-gluo
- 神经网络是一种模范动物神经网络行为特征，进行分布式并行信息处理的算法数学模型。这种网络依靠系统的复杂程度，通过调整内部大量节点之间相互连接的关系，从而达到处理信息的目的。 -The neural network is a model animal neural network behavioral characteristics of distributed parallel algorithm mathematical model of information processing. S
MyPolyTopo
- 多边形拓扑演示的VB程序和代码。程序对输入的图形文件基本数据进行拓扑构建，生成结点、线段、弧段、多边形等数据结构，并显示图形和结构数据。程序内包含了多个常用的拓扑生成算法，供参考学习。-Program of the polygon topology demonstration VB code. Topology construction procedures for the basic data of the input graphics file, the data structure of
hafuman1
- hafuman编码的一个源程序，可以运行。运行时输入节点数、输入各点权值即可得到哈弗曼树的构造过程-hafuman encoding a source, you can run. Runtime input nodes, enter the weight value of each point can be obtained during the construction of Huffman trees
Dijkstra[VCPP]
- Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。-Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm for calculating a node to all other nodes in the shortest path.
BFSPDFS
- 广度优先搜索和深度优先搜索在网络拓扑图上的实现。广度优先搜索是从某一节点开始，搜索与其线连接的所有节点，按照广度方向像外扩展，直到不重复遍历所有节点；深度优先搜索是从某一节点开始，沿着其搜索到的第一个节点不断深入下去，当无法再深入的时候，回溯节点，然后再在回溯中的某一节点开始沿另一个方向深度搜索，直到不重复的遍历所有节点。 -Breadth-first search and depth-first search in the network topology is realized. Bre
Get-the-coordinates-of-each-node
- 得 到节点坐标和单元内包含的节点的程序如下，可以在ANSYS的帮助中找到每一个命 令的详细解释。将下面的程序拷贝到一个文本文件中 filename.txt，保存，去掉后 缀名TXT，再拷贝到工作目录下。在命令提示符下输入*use filename，生产一个geomfile .txt文件，打开可以看到里面的数据-Get nodes and nodes within the cell that contains the coordinates of the procedure is as
time
- 分布式和集中式图像处理的节点数与网络生命周期的二维坐标图-Number of nodes in the distributed and centralized image processing and the network life cycle of a 2 d figure