搜索资源列表
PolynomialIncludingAllFunctions
- 一元多项式符号计算-含因式分解版 不仅包含+,-,*,/,多项式求值,数值积微分,(内含多项式求根子程序),定与不定积分,还有因式分解(求根法). 用单链表.输入格式按提示.-one yuan polynomial symbolic computation-containing factorization version not only contains ,-,*,/, polynomial evaluation, Numerical plot differential (intron
csdnalgorith
- 本材料积成了各种有关算法的问题讨论，包含了很多具体事例和问题的求解过程及说明，是学习算法不可或缺的资料-plot became the various algorithms to discuss the issue, contain many specific examples and problems in the solution process and explanations learning algorithm is essential for the
SegmentsIntersection
- 计算几何的利用叉积判断线段是否相交的算法，这个算法算法导论上有详细的介绍-The use of computational geometry plot fork intersection to determine whether segments of the algorithm, this algorithm has a detailed introduction to algorithms introduction
zojcode
- zoj 400道ACM 源码，是在ZOJ混的ACMer必备。希望对大家有点帮助。-zoj 400 Dao ACM source code, is essential in the ZOJ mixing ACMer. Hope to everyone to some extent.
hua
- 一个画函数图像的C语言程序，很有意思的，希望能够给大家带来一些帮助和启发谢谢大家。-a program to plot.
src
- Apriori algorithm is a kind of association rules mining frequent itemsets algorithm, its core idea is the downward closure detection by candidate set generation and the plot of the two phase for mining frequent itemsets. And the algorithm has been wi
Apriori
- 数据挖掘算法 挖掘数据之间的关联性，实现事件发生的预测 核心思想是通过候选集生成和情节的向下封闭检测两个阶段来挖掘频繁项集-Data mining association between the data mining algorithms to achieve predicted core idea of the event is to dig down through the closed frequent item sets of two-stage detec
km
- Kuhn-Munkers算法的几种变形应用 1.Kuhn-Munkers算法是求最大权完备匹配，如果要求最小权完备匹配怎么办？方法很简单，只需将所有的边权值取其相反数，求最大权完备匹配，匹配的值再取相反数即可。 2.Kuhn-Munkers算法的运行要求是必须存在一个完备匹配，如果求一个最大权匹配(不一定完备)该如何办？依然很简单，把不存在的边权值赋为0。 3.Kuhn-Munkers算法求得的最大权匹配是边权值和最大，如果我想要边权之积最大，又怎样转化？还是不难办到，每条
graph poly maple FVM
- Plot graphs in maple for polynomials