快速 c + + xml 解析器

安徽工程科技学院 2009年计算机07级数据结构课程设计题目及要求-Anhui Institute of Engineering and Technology in 2009 a computer 07 data structure and requirements of the subject curriculum design

哈夫曼树，基本的数据结构，用来编码和解码、用数组作为存储结构实现，

N皇后的排列树与子集数算法！里面是Cpp的源代码 带注释-N Queen subset of the arrangement of trees and the number of algorithms!

逆阵的常用算法!希望能给大家带来帮助!如果有更好的算法,可别忘记发给我啊! emil:wyx32893039@163.com-inverse matrix algorithm commonly used! Give us some hope! If there is a better algorithm, it should not be forgotten that give me ah! Emil : wyx32893039@163.com

赫夫曼编码程序，配套于数据结构教学书（南航）-Huffman coding procedures, data structures in supporting the teaching book (Southern)

同一个数据库开发的系统，里面有源代码和发布版本-with a database development systems, which Active code and releases

Matlab应用篇提供了大量的Matlab应用实例。配合前三篇所讲内容，巩固Matlab知识。-Matlab Application chapter provides a large number of application examples Matlab. Compatible with the three have said, the consolidation of Matlab knowledge.

this is a tunning algorithem

哈夫曼树算法 根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj 在森林中选取两棵根结点权值最小的树作左右子树，构造一棵新的二叉树，置新二叉树根结点权值为其左右子树根结点权值之和 在森林中删除这两棵树，同时将新得到的二叉树加入森林中 重复上述两步，直到只含一棵树为止，这棵树即哈夫曼树 -Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree

用BP算法对某个表达式进行模拟，通过模拟来得到最优的结果-BP algorithm for the simulation of a certain expression, through simulation to get the best results