搜索资源列表
Tug og war.rar
- Tug of War A tug of war is to be arranged at the local office picnic. For the tug of war, the picnickers must be divided into two teams. Each person must be on one team or the other; the number of people on the two teams must not differ by more than
头文件
- 大三计算机的数据结构的 c++ 所用的 头文件-junior computer data structure used by the c in the first paper
一元稀疏多项式计数器
- 一元稀疏多项式计算器[加法和乘法] 问题描述： 设计一元系数多项式计数器实现两个多项式间的加法、减法。 基本要求： （1） 输入并建立多项式 （2） 输出多项式，输出形式为整数序列：n，c1，e1，c2，e2……cn，en，其中n是多项式的项数，ci，ei分别为第i项的系数和指数。序列按指数降序排列。 （3） 多项式a和b相加，建立多项式a+b，输出相加的多项式。 （4） 多项式a和b相减，建立多项式a-b，输出相减的多项式。 用带表头结点的单链表存储多项式。 测试数据： (1) (2x+5x8
一维四点偏心格式vb源程序
- 一个用VB编写的一维四点格式算法的源程序，很好用-one prepared by the VB one-dimensional 4:00 algorithm source format, with a good
1.191.204.30
- 数据结构习题集答案，经多次修改而成，比答案册还要清楚简单。-data structure answer to the questions set by several revisions, but clearly the answer List simple.
Lis1t
- 文件中是我编写的两个数据结构，线性表列和链表，是用类模版函数编写，是面向过程设计-document is prepared by the two data structure, tabulated and linear chain and is prepared category template function, process-oriented design
二叉树操作&图的遍历操作
- 二叉树操作&图的遍历操作， 完全按照里面的文挡用VC所完成的程序， 有详细的说明-binary tree traversal operation of the plan operations, in full accordance with the text inside the block with VC performed by the procedure is described in detail in
最短距离问题
- 求解网络中的最短路径。假设某个计算机网络有n个站点，依次编号为1,2,…,n；有的站点之间有直接的线路连接（即这两个站点之间没有其它站点），有的站点之间没有直接的线路连接。如果用三元组（i,j,f）来表示该网络中的站点I和站点j之间有直接的线路连接且它们之间的距离为f 当已知该网络各站点之间的直接连接情况由m个三元组（i1,j1,f1）,(i2,j2,f2),…,(im,jm,fm)确定时，要求计算出对于网络中任意一个站点g(1≤g≤n)到其余各站点的最短距离。-the shortest pat
smatrix
- 数据库课程设计，用完全链表结构实现稀疏矩阵的创建，删除，以及加、减、乘、转置运算-database curriculum design, fully linked list with sparse matrix structure to achieve the creation, deletion, and, plus or minus, by transfer of home computing
fina_ver
- 用迷宫算法实现聚点的统计，这里只是简单扫描每个像素的四个方向，当然，可以很容易修改源码，实现八个方向的扫描，至于聚点嘛，就是被数码0包围的数码1组成的块，这种算法在元件识别方面可以应用。-maze algorithm used accumulation of statistics, here simply scanning each pixel of the four directions, of course, you can easily modify the source codes to
用分枝定界法求解TSP
- 分支定界法可以求解小规模的TSP问题,这个例子是用vc编写的-branch and bound method can solve small-scale TSP, this example was prepared by the vc
数据结构课设
- 用c编写的数据内部排序方法,可在窗口中选择多种排序方法,如快排,冒泡,折半插入等,还可以选择排序数据的个数,初态,控制等.-using data prepared by the internal order, the window can choose a variety of sequencing methods, such as fast Pai, bubbling half insert, can also choose the number of original data, the i
二叉树程序
- 本程序实现了二叉排序树的建立以及查找,插入和删除的功能.-realized by the two forks of trees to establish order and search, insert and delete functions.
NudtCommonTree
- 由STL扩展的树范型。该范型支持边的加权。树封装了内存管理，使得程序员免予释放、分配节点内存。附有实例程序-STL extended by the tree-Fan. Fan support for the type of edge-weighted. Tree Packaging, a memory management, allowing programmers to exempt from release, distribution nodes memory. With examples
Larry_Wasserman_ALL_OF_Statistics
- 这本书就是著名的沃塞曼编写的《统计学完全教程》，它的特点是覆盖全面、实用性强，除常规内容还包括Bootstrap方法、有向图DAGs估计、Wald检验、Delta方法、统计泛函估计等。-This book is prepared by well-known Wasserman 《ALL OF Statistics》, which are covered by the characteristics of a comprehensive, practical, in addition to con
provide-by-GeeMaple
- 东大软件学院数据结构（SSD5）实践课程（大三上学期的课），内容包括：实验指导书，实验5（1-5）个人代码，实验报告，以及ppt（虽然ppt简陋了点）。-SSD5 experiments in NEU, it is an simple auction
Europe-by-Rail
- 有关数据结构中的图的单源最短路径问题，以欧洲铁路图为原型-Map the data structure of single source shortest path problem, The picture shows the prototype of the European railway
Europe-by-Rail
- 欧洲游【Dijkstra（迪杰斯特拉）算法】，典型的单源最短路径算法-Europe by Rail
to-see-the-Olympics-by-bus
- 数学建模题目-乘公交看奥运代码，实现北京地铁公交换乘次数少，时间少，费用少-Mathematical modeling topics- code by bus to see the Olympics, realization of Beijing subway transit times less, less time and less cost
see-the-Olympics-by-bus-and-subway
- 数学建模题目-乘公交和地铁看奥运代码，实现北京地铁公交换乘次数少，时间少，费用少-Mathematical modeling topics- by bus and subway watching Olympic code, to achieve the Beijing subway transit times less, less time and less cost