小生成树其实是最小权重生成树的简称。一个有n个结点的连通图的生成树是原图的极小连通子图，且包含原图中的所有n个结点，并且有保持图连通的最少的边。最小生成树可以用kruskal（克鲁斯卡尔）算法或Prim（普里姆）算法求出。
The young adult tree is actually the abbreviation of the minimum power regeneration. The spanning tree of a connected graph with n nodes is the minimal connected subgraph of the original graph, and contains all n nodes in the original graph, and has the least edge to keep the graph connected. The minimum spanning tree can be obtained using kruskal (kruskal) algorithm or Prim (Prim) algorithm. (2018-02-09, Visual C++, 4KB, 下载1次)
数据结构（c++)第二版清华大学出版社实验报告加代码1、构造huffman树
2、实现huffman编码和解码
3、根据用户从键盘输入的报文文字输出各字符的huffman编码以及报文的编码：
如：CASTCASTSATATATASA输出报文的huffman编码及长度：报文111011010110101101011001001001001100长度：35输出上述报文的解码：CASTCASTSATATATASA对输入的编码：0111010110110输出解码：ACATSS
Data structure (c++) Second Edition Tsinghua University Press report added code an experiment, huffman tree structure 2, to achieve huffman encoding and decoding according to user output huffman coding each character encoding messages and keyboard input text messages : eg: 35 outputs the decoded messages:: huffman coding CASTCASTSATATATASA output packet and length: the length of the packet 111011010110101101011001001001001100 CASTCASTSATATATASA input code: 0111010110110 output decoding: ACATSS (2014-12-22, Visual C++, 3972KB, 下载3次)
约瑟夫斯问题求解（约瑟夫斯（Josephus）问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为报数上限值m，从第一个人开始按顺时针方向自1开始报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向下一个人开始重新从1报数，如此下去，直至所有的人全部出列为止。试设计一个程序，按出列顺序印出各人编号。）本程序就是解决上述问题
Josephus Problem Solving (Josephus (Josephus) a description of the problem is: numbered 1,2, ..., n, n individuals in a clockwise direction around a circle, each holding a password (positive integer). A start optionally a positive integer as the upper limit of the number of reported m, started from the first in a clockwise direction starting from the number reported, report stops at several m. reported m people out of the line, his password as the new m values , in a clockwise direction from the next person he began to re-number from a newspaper, and so on, until all the people all the columns so far. tried to design a program, according to the column order prints each number.) this program is to solve the above problems (2013-11-09, Visual C++, 1KB, 下载2次)
acm超级经典的算法。内容包括河内塔
费式数列
巴斯卡三角形
三色棋
老鼠走迷官（一）
老鼠走迷官（二）
骑士走棋盘
八个皇后
八枚银币
生命游戏
字串核对
双色、三色河内塔
背包问题（Knapsack Problem）
数、运算
蒙地卡罗法求 PI
等等。
acm super classic algorithms. Including Hanoi Tower Fei-style Liebasika triangle tricolor chess mice gone astray officer (a) mice have gone astray officer (two) Knight walked eight queens eight silver checkerboard game of life string matching color, three-color Towers of Hanoi knapsack problem (Knapsack Problem), calculating the Monte Carlo method for the PI and so on. (2013-09-14, Visual C++, 434KB, 下载2次)
描述：足球俱乐部包括球员、普通行政人员。球员有姓名、年龄、能力、年薪、转会费、进球总数、服役年限等重要参数；普通行政人员有姓名、年龄、能力、年薪等参数。你需要给相关管理机构开发一个管理程序，实现对众多足球俱乐部管理的基本功能。具体功能包括：
a) 俱乐部的增删改查，俱乐部的属性包括名称、现金、其下人员；
b) 可以对所有球员的各项属性进行简单搜索，支持输入多个条件，条件之间用&&连接，例如：
i. “年龄不大于25且服役年限大于5年且进球数大于100的球员”，查询表达式：!(@age>25) && @experience>5 && @kick>100
c) 支持球员在不同俱乐部间的买卖，买卖需符合以下条件：作为买方的俱乐部的现金>=球员的转会费，交易完成后，卖方将得到转会费。
要求：
d) 必须采用面向对象的方式，使用类组织数据结构，并注意类的继承关系；
e) 在题目要求基础上可以自行扩展功能，提供扩实用扩展功能者适当加分（加分不超过5分）。
Description: Football club including players, general administrative staff. Player name, age, ability, salary, transfer fee, total number of goals, service life and other important parameters ordinary administrative staff name, age, ability, salary and other parameters. You need to give the relevant management agencies to develop a management program to achieve the number of football club management s basic functions. Specific features include:
a) the club CRUD, the name of the club s property, including cash, under which personnel
b) all players can perform a simple search of the property, supports input multiple conditions with && connection between conditions, for example:
i. "Age is not greater than 25 and greater than 5 years service life and goals more than 100 players," query expression:! (@ age> 25) && @ experience> 5 && @ kick> 100
c) Support the players traded between different clubs, the sale subject to the following conditions: As a buyer s club cash> = pl (2013-08-20, Visual C++, 1492KB, 下载9次)
Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。该算法名称以创始人之一、1978年图灵奖获得者、斯坦福大学计算机科学系教授罗伯特·弗洛伊德命名。
Floyd algorithm, also known as Freud algorithm, the insertion point method is an algorithm used to find the shortest path between vertices given weighted graph. The algorithm name to one of the founders, the winner of the 1978 Turing Award, named after the Stanford University computer science professor Robert Freud. (2013-03-20, Visual C++, 1KB, 下载4次)
Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。该算法名称以创始人之一、1978年图灵奖获得者、斯坦福大学计算机科学系教授罗伯特·弗洛伊德命名。
Floyd algorithm, also known as Freud algorithm, the insertion point method is an algorithm used to find the shortest path between vertices given weighted graph. The algorithm name to one of the founders, the winner of the 1978 Turing Award, named after the Stanford University computer science professor Robert Freud. (2013-03-20, Visual C++, 1KB, 下载2次)
有一个已经有序的数据序列，要求在这个已经排好的数据序列中插入一个数，但要求插入后此数据序列仍然有序，这个时候就要用到一种新的排序方法——插入排序法,插入排序的基本操作就是将一个数据插入到已经排好序的有序数据中，从而得到一个新的、个数加一的有序数据，算法适用于少量数据的排序，时间复杂度为O(n^2)。
There is an ordered sequence of data required to insert a number of good data sequence has been ranked, but asked to insert this data is still orderly sequence, this time is necessary to use a new sort- insertion sort law, the basic operations of insertion sort is a data inserted into the already sorted ordered data, so as to get a new number plus an ordered data, the algorithm is suitable for the sort of small amounts of data, the time complexity is O (n ^ 2). (2012-10-28, Visual C++, 1KB, 下载3次)
c++应用电子书籍，独立打包，保证单包可解压，内含大量电子书，网上搜集而来，持续更新中......
本包内容：
ATL开发指南.pdf
ATL_开发指南中文pdf_第二版.rar
C++ 标准程序库 - 中文版.pdf
C++编程艺术.pdf
C++中级培训教材.doc
CC++指针经验总结_程序设计.rar
300种加解密算法和原理.zip
《数据结构习题集+答案 C语言版》- 严蔚敏、吴伟民.zip
Chrome源码剖析.doc
application of e-books c++ independently packaged single package can be unpacked, containing a large number of e-books, collected from the Internet, continuously updated ... the package contents: ATL Developer s Guide. pdf ATL_ Development Guide Chinese pdf_ the second edition of the. rar C++ Standards Library- Chinese version the. pdf C++ programming art the. pdf C++ Intermediate training materials summarize _ programming doc CC++ pointer experience. Rar 300 encryption and decryption algorithms and principles zip " data structure problem sets+ answer C-language version of " - Yan Wei Min, Wu Weimin. zip Chrome source code analysis. doc (2012-09-16, Visual C++, 58011KB, 下载6次)
银行家算法是避免死结(Deadlock)的一个著名的算法，是由艾兹格·迪杰斯特拉在1965年为T.H.E系系统设计的一种避免死结产生的算法。它以银行借贷系统的分配策略为基础，判断并保证系统的安全运行。
The banker' s algorithm is a well-known algorithm to avoid deadlock (Deadlock), and a way to avoid deadlock generated by algorithm 艾兹格迪杰 Stella in 1965 THE Department of System Design. Allocation strategy of the bank lending system, based on the judgment and to ensure the safe operation of the system. (2012-08-18, Visual C++, 52KB, 下载3次)
一、 设计要求
1．问题描述
设计程序用十字链表实现稀疏矩阵的加、乘、转置。
2．需求分析
（1）设计函数建立稀疏矩阵，初始化值。
（2）设计函数输出稀疏矩阵的值。
（3）构造函数进行两个稀疏矩阵相加，输出最终的稀疏矩阵。
（4）构造函数进行两个稀疏矩阵的相乘，输出最终的稀疏矩阵。
（5）构造函数进行稀疏矩阵的转置，并输出结果。
（6）退出系统。
A, the design requirements
1. The problem statement
Design program with ten medium realize sparse matrix with the table, multiply and transposed.
2. Demand analysis
(1) design the function up sparse matrix, the initial value.
(2) design function of sparse matrix output value.
(3) to construct the functions of the two sparse matrix addition, output final sparse matrix.
(4) to construct the functions of the two sparseness matrix multiplication, the output of the final sparse matrix.
(5) to construct the function of sparse matrix to buy, and output.
(6) exit system.
(2012-06-02, Visual C++, 4KB, 下载5次)
假设一个存储结构实现双向堆栈顺序,也就是说,一维数组的储存空间,有两个堆栈,他们位于底部的堆阵列的两个端点。尝试着去写实现双向堆Tws三种操作:最初的inistack(Tws),到堆栈推(Tws,我、x)和堆栈流行(Tws,我)算法,该算法可以我0或1,所以分别在一个数组或指示两端的两个堆栈。
Suppose a storage structure order implement a two-way stack, that is, the one dimensional array of storage space has two stack, they are located in the bottom of the stack of the array of two endpoints. Try to write to realize the two-way stack of Tws three operation: the initial inistack (Tws), into the stack push (Tws, I, x) and the stack pop (Tws, I) algorithm, which I 0 or 1, respectively in an array or so for instructions on both ends of the two stack. (2011-12-19, Visual C++, 1KB, 下载2次)
KMP 改进的字符串匹配算法,由D.E.Knuth与V.R.Pratt和J.H.Morris同时发现，因此人们称它为克努特——莫里斯——普拉特操作（简称KMP算法）。KMP算法的关键是根据给定的模式串W1,m,定义一个next函数。next函数包含了模式串本身局部匹配的信息。
Improved KMP string matching algorithm, by DEKnuth with VRPratt and JHMorris also found, so people call it Knuth- Morris- Pratt operations (referred to as the KMP algorithm). KMP algorithm, the key is given of a pattern W1, m, define a next function. next function mode of the string itself contains a partial matching. (2011-11-10, Visual C++, 1KB, 下载4次)
1、实现算术表达式的求值运算，程序通过键盘输入一个表达式，通过运算得到表达式的值，并在显示器上输出完整的表达式及其值；
2、程序实现时，采用栈数据结构
3、表达式以字符串的形式输入；
4、表达式中包括的基本运算符有加、减、乘、除（分别用+、-、*、、表示），表达式中包括括号的处理，括号可以嵌套；表达式中的数字可以是整数，也可以是小数
1, and the evaluation of arithmetic operations, the program through keyboard input an expression, obtained by computing the value of the expression and display the full expression of the value of output 2, program implementation, the use of the stack data structure 3, the expression as a string input 4 expression, including the basic operators are add, subtract, multiply and divide (respectively+,-,*,, said), the expression including the handling of parentheses, Parentheses can be nested expressions can be integer numbers, can also be fractional (2011-04-09, Visual C++, 3KB, 下载2次)
数据结构课后设计题第六章
6.33③ 假定用两个一维数组L[1..n]和R[1..n]作为
有n个结点的二叉树的存储结构， L[i]和R[i]分别指
示结点i的左孩子和右孩子，0表示空。试写一个算法
判别结点u是否为结点v的子孙。
Data structure design question after class VI 6.33 ③ assumed with two one-dimensional array L [1 .. n] and R [1 .. n] as an n-node binary tree storage structure, L [i ] and R [i] i were instructions left child node and right child, 0 means empty. Try to write an algorithm to determine whether node u is node v' s descendants. (2010-06-07, Visual C++, 3KB, 下载1次)
提出一种新的Hamilton阵列编码的设计方法。在不用求出整个Hamilton阵列编码前提下，根据码距和维数要求，直
接求出编码阵列中的某一具体的码元，预先构造出系数矩阵。和以往模型不同的是借助这个设计模型可以实现以任意顶点为起始点
的Hamilton阵列编码，从而使得构造整个Hamilton阵列编码更灵活、更快速
This paper proposes a new design method for Hamilton array codes.According to the hamming distance and
dimension this method can obtain a code element of the array without constructing the whole Hamilton array codes,and
then constructs the coefficients matrix.Different from previous models,this model can realize Hamilton array codes
taking any vertex as the initial one,thus making the construction of the Hamilton array codes more flexible and quicker.
Finally,the paper also gives a design example according to the proposed model (2010-04-02, Visual C++, 699KB, 下载5次)
/*
描述：
1.自定义分数类fraction，使用该类可以完成分数的输入、分数的加、减、乘、除二目运算和一目减运算、分数的约分操作、分数的倒数运算、对两个分数进行六种比较运算、以及对分数的输出等操作。
2.尽量用运算符重载函数。如，可重载+、-、*、/、>、>=、<、<=、==、!=，以实现分数的各种运算。并且实现分数与整数的混合运算。
3.尽可能考虑程序性能。
/* Description: 1. Custom scores of class fraction, the use of such scores can complete the input of scores add, subtract, multiply, in addition to two operations and a head and cut operation, scores of about sub-operation, scores of the reciprocal operation, pairs of two scores in the six comparison operators, as well as scores of output and other operations. 2. The best use of operator overloading function. For example, can be overloaded+,-,*,/,> ,> =,< ,< =,==,!=, in order to achieve a variety of computing scores. And achieve scores and mixed integer operations. 3. As far as possible to consider application performance. (2009-12-18, Visual C++, 2KB, 下载27次)
课程设计是实践性教学中的一个重要环节，它以某一课程为基础，可以涉及和课程相关的各个方面，是一门独立于课程之外的特殊课程。课程设计是让同学们对所学的课程更全面的学习和应用，理解和掌握课程的相关知识。《数据结构》是一门重要的专业基础课，是计算机理论和应用的核心基础课程。
数据结构课程设计，要求学生在数据结构的逻辑特性和物理表示、数据结构的选择和应用、算法的设计及其实现等方面，加深对课程基本内容的理解。同时，在程序设计方法以及上机操作等基本技能和科学作风方面受到比较系统和严格的训练。
本课程设计是利用栈的相关操作实现对任意长的整数进行加、减、乘、除四则运算。
程序运行可以实现任意长整数的四则运算。例如：
进行加法运算时：
输入-23456789；-76543211；输出-100000000。
输入-99999999；1000000000000输出999900000001。
err (2009-01-05, Visual C++, 262KB, 下载8次)
二叉排序树（Binary Sort Tree--BST）或者是一棵空树；或者是具有下列性质的二叉树：
⑴ 若左子树不空，则左子树上所有结点的值均小于根结点的值；若右子树不空，则右子树上所有结点的值均大于根结点的值。
⑵ 左右子树也都是二叉排序树。
(3) 中序遍历BST可得到一个关键字的有序序列
文本文件单词索引是指将文本中单词按字母顺序列出并且列出每个单词在文本中出现的次数，它也是关键字列表的一种特例，即单词为关键字并附加每个关键字在文中出现次数.文本文件单词索引常用于作者著作分析以此决定有争议作品作者身份。
实验目的与目标
err (2008-11-25, Visual C++, 1KB, 下载8次)
一个多项式运算程序 实现多项式的加 减 乘除 乘方 积分 微分 混合运算
一个二叉树运算程序 实现二叉树的创建 复制 深度计算 和树形显示
一个哈夫曼算法的演示程序 实现对电文的编码 编码的输出 和编码的还原
程序共三个 模块已经超过了五个 没有分开写
Operational procedures for the realization of a polynomial polynomial addition and subtraction, multiplication and division involution mixed integro-differential operator realization of a binary tree binary tree computing process of the creation of copy depth calculation and display a Huffman tree algorithm demo program to realize the message coding coding and coding the output of the restore process a total of three modules have been no more than five separate write (2008-03-26, Visual C++, 11KB, 下载4次)