搜索资源列表
AlgBB
- *程序AlgBB用于求解甲乙城市之间的最短路径的分支限界问题 * //*输入:距离文件m1.txt,耗费文件m2.txt * //*输出:甲乙城市间的具体最短路径及其总长度和总耗费
MAIN 3-DIMENSIONAL CFD-PROGRAM
- #//u(i,j) x方向的速度u;或者θ方向速度uθ #//u(i,j) y方向的速度v;或者径向速度ur'h\K #//pc(i,j) 压力修正 p'[OS #//p(i,j) 压力p-=5-+ #//p(i,j)
PalindromeNumber
- To find and output 11-999 between the number of m, it is to meet m, m2 and m3 are several palindrome. The so-called palindrome refers to the number of its symmetrical figures that the whole number, for example, 121,676,94249 and so on. To meet the ab
GetZmnGeneral
- 通过本函数计算计算三角单元内非奇异积分,输入参数:m1,m2,m3 --检验函数三角形三个顶点编号,其中,m1与m边对应- the nonsingular integrals are calculated by analytical method. m1,m2,m3 three point of the triangle
GetZmnSinaular
- 这个函数用来计算阻抗阻阵中的奇异项积分,m1,m2,m3 --检验函数三角形三个顶点编号,其中,m1与m边对应 //n1,n2,n3 --展开函数三角形三个顶点编号,其中n1与n边相对-the singular integrals are calculated by analytical method. m1,m2,m3 three point of the triangle
Recursive_integer_division
- 递归法求解整数划分。 整数划分,是指把一个正整数n写成如下形式: n=m1+m2+…+mi (其中mi为正整数,并且1 <= mi <= n),则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m,即max(m1,m2,...,mi)<=m,则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m)-Recursive method integer division. Integer divisi
line-plane-intersection
- 求空间直线与平面的交点 已知直线L过点m(m1,m2,m3),且方向向量为VL(v1,v2,v3), 平面P过点n(n1,n2,n3),且法线方向向量为VP(vp1,vp2,vp3),求得直线与平面的交点O的坐标(x,y,z)(Find the intersection of space, line and plane the line L is known to be over M (M1, M2, m3), and the direction vector is VL (V1