C++编程设计 关于数据结构 本书是一本无需任何程序设计基础累的书籍...

long bei ge suan fa 龙算法-long bei ge suan fa Long algorithm

数据结构的课后练习-Data structure of the after-school practice

这是一个PB小程序　是实现模糊查询的.这是一个PB的小程序，实现模糊查询的 这是一个PB的小程序，实现模糊查询的-PB This a small program is vague inquiries. This a small program PB, Fuzzy inquiry, which is a PB of small programs to achieve fu zzy inquiry, which is a PB of small programs to achieve fuzzy inquiry, which is the one PB small program for the realization of fuzzy

离散01串问题，(n,k)01 串定义为：长度为n 的01 串，其中不含k 个连续的相同子串。对于给定的正整数n 和k，计算(n,k)01 串的个数。-discrete series of 01 questions, and (n, k) 01 Series : the definition of the length of n strings of 01, which is non-consecutive k-the same string. For a given positive integer n and k, calculated (n, k) 01 series of numbers.

用于餐厅管理以及各种人事，营业流水查询及历史查询-For Restaurant Management and a variety of personnel, business inquiries and the history of water inquiry

用prim算法实验最小生成树 本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树 定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。 定义二维数组g[ ][ ]来建立无向图的邻接矩阵。 -Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.

一元稀疏多项式计算器的基本功能是： (1)输入并建立多项式； (2)输出多项式，输出形式为整数序列：n,c1,e1,c2,e2,….,cn,en, 其中n是多项式的项数，ci和ei分别是第I项的系数和指数，序列按照指数降序排列； （3）多项式a和b相加，建立多项式a+b （4）多项式a和b相减，建立多项式a-b.-Sparse Polynomial calculator a dollar a basic function is to: (1) input and the establishment of polynomials (2) the output polynomial, the output sequence of the form of an integer: n, c1, e1, c2, e2, ...., Cn , en, in which n is the number of polynomial, ci and ei, respectively, is the first I of the coefficient and index, sequence in accordance with the index in descending order (3) polynomials a and b are added together to establish polynomial A2B ! b (4) polynomials a and b-phase reduction, the establishment of polynomial ab.

有需要的同仁载回去慢慢研究-need colleagues set back slowly study

应用背景从推特挖掘社交数据框架。利用推特流API，允许听多流一次。 ； ； ； ； ； ； ； ；关键技术miltiprocessing和代理允许创建多个同步流没有达到的速率限制。框架处理线程安全的SQL存储& nbsp；

数据结构哈希表的实现，用C++写的，比较完整-Hash table data structure to achieve, using C++ Written relatively complete