搜索资源列表
huffman_f
- huffman_f 在huffman_e的基础上，将排序改为利用堆排序原理选择最小的两个权值。也即，将所有元素的权值组织成堆后，每次堆内的根结点就是最小值了。每取出一个根结点后，就把堆尾元素调到根结点重建堆。取出两个最小值合并成一个子树后，再把子树作为叶子结点放到堆中，并让其上升到合适的位置，保持堆性质不变。因为每次不必完成整个排序过程，而只是组织成堆，因此，这种方法要比使用快速排序更快。上述算法参考了mg-1.2.1中Huffman编码的实现，见http://www.cs.mu.oz.au/m
VB--Delaunay
- delaunay图形大家再熟悉不过了,用VB编写的生成方法大家可以参考一下-nodes graphics everyone familiar, with VB prepared by the method of generation we can take a look
tsp
- In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) such that the sum of the weights of its constituent edges is minimized. An example is finding the quickest way to get from one location to ano
Network_Drawer.m
- THis function make and plot a random network with N nodes input N: number of nodes r: radius of adjacency s = [s1 s2] is the coordinates of the rectangular in which the nodes are spread output adj_mat: adjacency matrix Lap_ma
binary_tree
- 二叉树的一些基本操作，建立，删除，增加删除节点，-Some of the basic operations of a binary tree, create, delete, delete nodes increases,
-giper.m
- Trilateration is the name given to the Algorithm used in Global Positioning System (GPS) technology to localize the position of a Transmitter/Receiver station (also called a Blind Node) in a 2D plane, using the positional knowledge of three non-linea
algorithm
- This paper presents a new algorithm for partitioning a gray-level image into connected homogeneous regions. The novelty of this algorithm lies in the fact that, by constructing a minimum spanning tree representation of a gray-level image, it reduce
Draw-Hermit
- MFC 绘制Hermit曲线，利用节点进行Hermit插值，适合进行数控开发以及计算机图形学研究-MFC drawing Hermit curve, the use of nodes for Hermit interpolation, suitable for the development of numerical control and computer graphics research
pdnmesh
- 自动实现N-S方程，只需要用户设置节点坐标，节点数目,进行流体、磁场计算-Automatic implementation of N-S equation, only need to set the node coordinates, the number of nodes, the fluid, magnetic field calculation
ctnk-Ethernet
- 电力系统潮流计算程序 9节点改进算法算例 不错的源码-Power system flow calculation program and 9 nodes algorithm example source code