二叉哥的二叉树

使用EPTREE可以很好的对，C,C++，Java代码进行解析。绘出函数树图，计算堆栈大小等。 功能树 INKURUDOFAIRUTSURI 测量若干步骤（有条件汇编） 函数索引（使用堆栈大小为每个功能输出） 使用类名单 全局变量，变结构，对象名单 ＃定义定义列表 清单中所使用 列表名称 信息分布函数的行数-EPTREE can be used for good, C, C++, Java code analysis. Mapping function tree diagram, calculate the stack size.

开源的的smt求解器，用于求解约束集的可满足性，能够支持位向量的求解，速度还算不错。

JPEG的解压算法，可以帮助初学者明确了解JPEG格式信息，对照代码可以明白数据标识码在那边表示，也可以修改他们做出相应调整。对于刚接触JPEG格式的人来说是有用的。 

fortran程序，迭代常微分方程求解器，包括源代码、使用说明。-fortran program, iterative solver of ordinary differential equations, including source code, use the instructions.

FPgrowth is the one of the algorithm in frequent item set mining. It is used to find the frequent item set in a database. It will give the output in tree structure format. It is more efficient than apriori algorithm because there is no candidate generation. 

应用背景adasdddddddddddddddddddddddddddddddddddddddddddadasdddddddddddddddddddddddddddddddddddddddddddспомощьюVинаспомощьюVинав。в。спомощьюVинаadasdddddddddddddddddddddddddddddddddddddddddddadasdddddddddddddddddddddddddddddddddddddddddddadasdddddddddddddddddddddddddddddddddddddddddddadasdddddddddddddddddddddddddddddddddddddddddddadasdddddddddddddddddddddddddddddddddddddddddddadasdddddddddddddddddddddddddddddddddddddddddddadasdddddddddddddddddddddddddddddddddddddddddddadasdddddddddddddddddddddddddddddddddddddddddddadasdddddddddddddddddddddddddddddddddddddddddddadasdddddddddddddddddddddddddddddddddddddddddddadasdddddddddddddddddddddddddddddddddddddddddddadasddddddddddddddddddddddddddddddddddddddddddd关键技术234567891011121314151617181920РазмерА（- 2，- 4） ； ；делаюя= - 3,2читать*，（В（Я，какДж），ДжвС= - 4,0） ；конецсделатьзвонокмассивные（В，Н）печать*，встопконецподпрограммымассивные（В，Н）измерениеВ（Н） ； ；нея= 2，н2СделатьДж=Я，НВвKиВ=Н-ДЖ+Яесли（в（

利用幂法求矩阵的最大特征值，还包括一些相应的辅助函数-Idempotent matrix method using the largest eigenvalue, also include a number of the corresponding auxiliary function

通过模式匹配寻找一个字符串的所有符合匹配的字串，然后用指定任意形式的字符长短替换

对植被冠层模型的分层拓展，将冠层分为多个小薄层，每一薄层之间用Adding method方法耦合，并且考虑了多次散射中的热点效应。可用于BRDF建模和LAI反演

任务分配问题可数学建模成二分图最大权匹配问题，利用k-m算法求解。我们可以将人员看成是顶点Xi，任务看成是Yj，W[i][j]是 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报