资源列表
algorithm
- 图包问题的多种解法，python实现，蛮力、gramham、分治-Many kinds of solutions, the python package diagram, brute force, Gramham, divide and conquer
Knapsack
- 01背包问题的java实现，使用了树结构，比较器-Java 01 knapsack problem of implementation, using a tree structure, the comparator
HuffmanTree
- 使用java实现的哈夫曼编码，中序遍历树结构，算法作业-Use java achieve Huffman coding, in order to traverse the tree structure, algorithms job
MergeSortL
- 归并排序的python实现，使用了邻接表，效率更高一些-Merge sort python implementation that uses the adjacency list, a number of more efficient
AVLTree
- 使用vc++6.0，实现平衡二叉树的操作演示，功能包括创建、查找、插入、删除、合并和分裂平衡二叉树。内附详细说明文档-Use vc++6.0, balanced binary tree operation and demonstration functions include creating, search, insert, delete, merge and split balanced binary tree. Included detailed documentation
kronecker_product
- 张量是一个定义在一些向量空间和一些对偶空间的笛卡儿积上的多线性函数，其坐标在 维空间内，有 个分量的一种量， 其中每个分量都是坐标的函数， 而在坐标变换时，这些分量也依照某些规则作线性变换。 称为该张量的秩或阶（与矩阵的秩和阶均无关系）。-Is a definition of a Cartesian tensor in some vector space and some dual space product multi linear function of
triangleSubdivision
- 用动态规划的思想实现多（N）边形的最优权值三角剖分-Using dynamic programming to achieve the optimal weights of multi- (N)- side- Profile
Assignment_2
- 算法课程中分支定界算法的课后习题作业，其答案和c++实现我也会上传-Branch and bound algorithm in the course of the algorithm, the answer and the c++ to achieve I will upload
elecfans.com_Kalman-filtering-matlab
- 这是一个实现卡尔曼滤波应用的代码，相关工作者可以下载查看-This is a code that applying Kalman filtering to reality.
suanfayushujujiegou
- 算法与数据结构基础程序,最后一个课程设计是一篇文章的词频统计-data structure
meanshift-tracking
- 本算法实现的是目标的跟踪，采用的是混合高斯模型建立背景，然后用meanshift进行跟踪，包括使用MFC进行界面编辑-The algorithm is to track the target, using Gaussian mixture model background, and then meanshift track, including the use of interfacial MFC edit
digital
- 利用广度优先搜索算法解决八数码难题，寻找从初始状态变换到目标状态的最优解-Use breadth-first search algorithm to solve eight digital problem, seek transformation initial state to target state optimal solution