C #用多元线性回归模型，一元钱当然可以..

使用ADO存储图片到Access的vc++简易相册，为哪些想学习把如何把图片保存到数据库的编程的人提供了很好的示范

这是本人精心搜集的关于常用图论算法的一套源码，代码内附注释，可供需要的朋友作为参考-carefully collected on the graph algorithm commonly used in a set of source code, code contains Notes the need for a friend as a reference

求和最大的子序列，采用动态规划算法，经典算法-sequences using dynamic programming algorithm, the algorithm classic

ＶＣ实现的用堆栈实现表达式求值！！ 数据结构的一个小作业！！ 大家可以参考一下-VC stack with the expression evaluates to achieve! ! Data structure of a small operation! ! We can take a look

图的深度优先遍历和广度优先遍历，以邻接矩阵方式输入。（按照提示输入）！ -map the depth and breadth traversal priority priority traverse to the adjacency matrix input. (According to the prompt entry)!

清华大学出版的数据结构（C++）的配套课件-Tsinghua University published the data structure (C) matching courseware

图论中二分图匹配求最佳匹配的KM算法，用c实现，简单易懂-Graph Theory in the bipartite graph matching the best match for KM algorithm, with c realize, easy-to-read

问题描述： 给定n个石子，其重量分别a1,a2,a3...an,要求将其划分成m份，每一份的划分费 义为这份石了中最大重量与最小重量的差的平方。总划分费用等丁m份划分费用之和。 编程任务 对于给定的n个石子，求一种划分方案，使得总划分费用最小。-Description of the problem: Given n-stones, its weight, respectively a1, a2, a3 ... an, asked that it be divided into m copies, each of the division of costs defined as the weight of the stone of the largest and the smallest weight difference the square. Small m the total costs were divided into the sum of the cost. Programming tasks for a given n-stones, seek a kind of division, making the total cost of the smallest division.

一个数据结构中关于链表的实验，创建链表等，包括增删查改-A data structure on the list of experiments, create list, including additions and deletions to search

数据结构c++-书的一些源代码-data structure c-some of the source code