tinyxml使用实例

用Dijkstra算法求有向网的v0点到其余各点v的最短路径P[v]及其带权长度D[v],开发语言为c语言。

dspic30F 变频器汇编驱动 三相电机 ，最佳方案，可以加减速。                                                               

设A和B是2个字符串。要用最少的字符操作将字符串A转换为字符串B。这里所说的字符操作包括： 1. 删除一个字符 2. 插入一个字符 3. 将一个字符改为另一个字符 将字符串A变换为字符串B所用的最少操作数称为A到B的编辑距离，极为d(A,B)。设计一个算法，计算任意两个字符串的编辑距离。 -Set A and B are two strings. Operation will use the least character string A is converted to a string B. Operation of characters are talking about here include: 1. Delete a character 2. Insert a character 3. Will be replaced by one character to another character will be transformed into a string A string of at least B operand used by A to B is called the edit distance is extremely d (A, B). Design an algorithm to calculate any two of the string edit distance.

最短路径算法源码(VB)-shortest path algorithm source code (VB)

距阵链乘问题: 找出矩阵链乘A(35*40) A(40*20) A(20*10) A(10*15)的最佳相乘次序。 算法来自:计算机算法导引-matrix chain by : identify matrix chain by A (35* 40) A (40* 20) A (20* 10) A (10* 15) concludes the best order. Algorithm from : computer algorithm Seeker

一个菲波拉契数列的DEMO程序-a Fibonacci series of procedures DEMO

棋盘覆盖,不错的-chessboard coverage, good

A matlab program for  multi-target tracking,The problem of multi-target tracking is comprised of two distinct, but tightly coupled challenges: (i) the naturally discrete problem of data association, i.e. assigning image observations to the appropriate target; (ii) the naturally continuous problem of trajectory estimation, i.e. recovering the trajectories of all targets. To go beyond simple greedy solutions for data association, recent approaches often

常用的各种进制转换，包括十六进和十进制互转，二进制、ascall的转换-A variety of commonly used M-ary conversion, including conversion hexadecimal and decimal, binary, ascall conversion

程序为采用matlab写的一个带孔圆板的EFG程序，这是一个学习和验证算法的标准算例，给出了可调控网格密度的网格生成程序，做数值算法的必学的程序