CRC的算法分析和程序实现

***

Delphi 写的常用的基本算法 源代码 -Written in Delphi source code for the basic algorithm used

利用Java实现回溯法工作分配，作业程序，写的简单清楚，分享下供大家借鉴。问题为：工作分配问题。设有 n 件工作需要分配给 n 个人去完成。将工作 i 分配 给第 j 个人完成所需要的费用为 cij。试设计一个算法，为每一个人分配一件不 同的工作，并使总费用达到最小。                                                         

C语言算法编程。最小生成树的Kruskal算法 。求加权连通图的最小生成树的算法。kruskal算法总共选择n- 1条边，（共n个点）所使用的贪心准则是：从剩下的边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选取的边若产生环路则不可能形成一棵生成树。kruskal算法分e 步，其中e 是网络中边的数目。按耗费递增的顺序来考虑这e 条边，每次考虑一条边。当考虑某条边时，若将其加入到已选边的集合中会出现环路，则将其抛弃，否则，将它选入。

给出N口井的坐标，把距离小于给定值的分为一组。只要一口井与这一组中有一口井小于给定距离，则它属于这组-N wells given the coordinates, distance less than the given value is divided into one group. As long as a well and the group has a well less than a given distance, it belongs to this group

adaptive dimension reduction for clustering high dimensional data

求逆矩阵--solution for inverse matrix

一维伽辽金型无网格法MATLAB程序 无网格方法采用基于点的近似，可以彻底或部分地消除网格，不需要网格的初始划分和重构，不仅可以保证计算的精度，而且可以大大减小计算的难度。然而，由于目前的无网格近似一般没有解析表达式，且大都基于伽辽金原理，因此计算量很大，要超出传统的有限元法；另外，无网格近似大都是拟合，因此对于位移边界的处理比较困难，多采用拉格朗日乘子法处理。-1维伽Galerkin-type meshless method MATLAB procedures meshless method based on the point of approximation, can be completely or partially eliminate the grid, the grid does not require the initial division and reconstruction, not only can guarantee the accuracy of the calculation, and can greatly reduce the difficulty of calculation. However, due to the current meshless approximation there is no analytic expression in general, and mostly based on the Galerkin principle, the calculation of a large volume, it is necessary to go beyond the traditional finite element method In addition, the meshless approximation are fitted, so displacement of the border more difficult to deal with, the use of Lagrange law.

任意元素的矩阵操作，包括加、减、乘、求行列式、求逆-An arbitrary element matrix operations, including addition, subtraction, multiplication, seeking determinant, inverse

根据地球上两点经纬度（以度分秒为单位），计算其间距离（以米为单位）。-calculate the distance between two points with latitude and longitude.