最短路径语言源代码实现的若干计划

这里有些代码我写了关于字符串实用程序。这帮助新手很容易明白的和有用的分析和编写脚本。 它是用非常常见算法。 如果东西搞错我联系的方式。不一定是每一件工作正常，但几乎 Im:D.

三态树：一个树控件的派生控件，完成item的三种状态-Tri-state tree: A tree control derivative controls, the three states to complete item

ｍａｔｌａｂ程序，用于计算时间序列中的自适应问题可以进行预测-Matlab procedures used in the calculation of time-series of adaptive problems can be predicted

matlab的数学物理方程数值算法源程序。这是"Numerical Methods for Physics"第二版的matlab源程序。-Matlab mathematical physics equations numerical algorithm source. This is the "Numerical Methods for Physics," the second version of the Matlab source.

在Turbo C环境下开发，实现对称矩阵的输入，并判定是否为正定。可以修改输入模块实现对任意非奇异矩阵求逆。求逆算法采用伴随矩阵法，求解行列式采用化上三角矩阵法。该算法系本人根据《线性代数》描述编写，矩阵的最大阶数可任意修改，更具有通用性。-in Turbo C development environment and achieve symmetric matrix input, and to determine whether the positive. Can modify the input module of arbitrary non-singular matrix inversion. Inverse algorithm adjoint matrix method, used to solve determinant of the upper triangular matrix. The algorithm is based on my "Linear Algebra" to describe the preparation, the biggest band Matrix will be able to arbitrarily amend, more versatile.

实验目的：用Lingo软件求解整数线性规划问题。 实验内容： 已知某个中型百货商场对售货人员的需求经统计如下表，实现工作的安排-Experimental Objective: Lingo software for solving integer linear programming problem. Experiment content: Are known to a medium-sized department store sales personnel, the demand for statistics by the following table to realize the work arrangements

约瑟夫环（Joseph）问题的一种描述是：编号为1、2、3……n的n个人按照顺时针方向围坐一圈，没人持有一个密码（正整数）。一开始任选一个正整数作为报数的上限值m，从第一个人开始按照顺时针的方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他的顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止（2）利用顺序表、单向循环链表两种存储结构模拟此过程

应用背景In this context, mobile communications may be allowed to be an indispensable commodity by most, and mobile data, video as well as television services are also becoming an essential part of everyday life. With the introduction of the Android operating system and the iPhone, the use of ebook readers such as the iPad, and the success of social networking using Facebook, the demand for cellular data traffic has grown significantly in recent years. Thus, communications on the move has proven to be transformational, and mobile operators struggle to satisfy the data traffic demands in wireless cellular networks,while keeping their costs at minimum to maintain profitability.关键技术The need for power-efficient MIMO-aided cellular networks requires a paradigm shift in the wireless system design. This trend is irreversible and will have a profound impact on both the theory and p

资源描述 11079 可以移动的石子合并（必做） 时间限制:1000MS  内存限制:1000K 提交次数:0 通过次数:0 题型: 编程题   语言: G++;GCC;VC;JAVA Description 有n堆石子形成一行(a1,a2,…,an，ai为第i堆石子个数)，现要将石子合并成一堆，规定每次可 选择至少2堆最多k堆移出然后合并，每次合并的分值为新堆的石子数。 若干次合并后，石子最后肯定被合并为一堆，得分为每次合并的分值之和。 现在求解将这n堆石子合并成一堆的最低得分和最高得分。 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报 打分 发表评论 暂无评论

遍历图像算法访问像素值扫描与指针图像扫描迭代器的图像编写高效的图像扫描循环扫描图像与邻居访问