computer

scport for monting your pc s port usage!

商人过河程序，找了好久才找到的程序......(shangrenguohe)

说明：  全球定位系统单点定位程序，根据N文件和O文件解算地面点的坐标(Global positioning system, single point positioning procedure, in accordance with N documents and O document solver coordinates of ground points)

C++普通计算器的功能，实现整数、小数的加减乘除的算法，有退格、清空的功能。(Common calculator functions)

说明：  一个C#开发的线性规划 单纯形算法，能够求解中小规模的线性规划问题，欢迎大家下载，自己写的哦！！(A C# development of linear programming simplex algorithm to solve the small and medium-scale linear programming problem, welcome to download their own writing Oh! !)

这是一个自己写的完整的ADO类 包含了两部分(This is a complete write their own ADO class contains two parts)

说明：  校园导游系统，是图的最短路径的应用 我短学期的课程小实验(Campus tour guide system, is the shortest path map application, I short-term courses of small experimental)

对一段只含有几种字符的字符串进行转换，转换成相应的数字(a string contains only several character conversion, and converted into the corresponding digital )

编写C程序，随机给出n*n的邻接矩阵，并打印输出邻接矩阵，以及有向图的边的个数，每个顶点的度，并判断该图中是否存在Euler回路： （1）如果为n阶，则随机产生一个n*n的邻接矩阵； （2）输出邻接矩阵，边的个数，每个顶点的度以及图中是否存在Euler回路。 这个题目涉及到了两个主要的知识点，一个是数据结构中的有向图的邻接矩阵的创建，还有就是离散数学中的Euler回路的判定定理。(The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.)

使用ceres对曲线进行拟合程序，ceres可以从github下载；(Using ceres fitting program, Ceres can be downloaded github )