搜索资源列表
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
Qsinghua-Data structure
- 清華大學的數據結構講義,經典的書籍,照這個講義複習,一切ok-Qinghua University, the data structure lectures, classic books, as the review notes, all ok
数据结构的稀疏矩阵运算器
- 利用十字链表的储存结构完成距阵的加,减,乘.数据结构实习题目,已完成选做内容.-use the storage structure to complete the matrix, plus or minus, riding. Internship topic data structure, so as to complete the election.
平衡二叉树c++
- 平衡二叉树生成 输入任意个节点 如 2 6 8 0为显示 可自动生成平衡二叉树 bf为平衡因子 h给深度 可插入删除 计算转动次数（wangliwei007也是我，质料没添全就换这个好号，请斑竹给我发个号好吗？我也想下载东西，急）-balanced binary tree generating arbitrary input nodes as 2 6 8 0 to demonstrate that automatically generates balanced binary tree bf f
树跟二叉树
- 本程序是实现二叉树跟树的常用算法，都是尽量用非递归来编写的。关于二叉树的都可以从键盘动态输入，关于树的就不可以，原因是树的结构问题，在程序中，树的建立用到动态左孩子/右孩子建立-this program is a binary tree with the tree is commonly used algorithm, as possible, to use non - recursive prepared. On the binary tree can be dynamic input fro
最短距离问题
- 求解网络中的最短路径。假设某个计算机网络有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
jzclass
- 改进的矩阵操作类,增加了诸如对矩阵任意行/列的存取,矩阵的积分图像的计算等-improved matrix operations, such as the right to increase the matrix arbitrary line / column access, image matrix of the integral calculation
字符频率统计
- 字符频度统计，采用Hash表即链表数组作为存储结构,是hash表的简单运用，还包括一定的文件操作-characters frequency statistics, the use of Hash Tables List that as a storage array structure, hash table is a simple application, but also some file manipulation
排序算法演示
- 各种常用的排序算法的演示程序， 以顺序表作为存储结构～～～～ 欢迎大家指正-A demo for different sort arithmetic,use qlist as store type. welcome ues and question
高精度数加减乘法
- 高精度数的加减乘法，可以自定义进制，作为类实现，直接使用即可。-precision the number of addition and subtraction multiplication can be defined band, as the category achieved, can be used directly.
数椐结构实验指导书
- 数据结构的实验算法 有线性表的，栈和队列，数组，树和而叉树，图，查找以及排序等算法的源代码 -experimental data structure is linear algorithm to the table, stack and queue, arrays, trees and the trees and fork, graphics, such as search and sorting algorithm source code
等级证书考试管理系统
- 用C语言或其他高级语言编程(最好C语言),基本功能：包括报名管理、成绩管理、证书管理等。能做到考试的报名成绩的录入与查询以及证书的发放等功能。实现有关功能的增加、修改、删除、查询和统计模块。根据要求知道，一个学生报名后就拥有唯一的考号，考号随着 考生取消报名而消失，所以可以以考号为Key来实现查找学生记录，实现有关功能的增加、修改、删除、查询.-C language or other high-level programming language (preferably C), the ba
fk1
- 有关于数据结构中用C语言作为源码的几个线性表，栈和队列的几个例子，其中包括基本的插入、删除、查找等功能-on the data structure used C language as the source of several linear table, stack and queue a few examples, including the basic insert, delete, search functions
92
- 本代码是用java语言编写的基于决策树c4.5算法的数据挖掘程序，它可以在很多领域如股票系统中使用 -the code is written in java-based Decision Tree Algorithm Bank data mining process, it can in many areas such as the use of the stock system
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
c语言常用算法（c语言）
- 一些c语言常用的算发，最近有程序设计比赛，也是比算法的，可以作为参考学习！-some of the language used fat count, the recent design competition procedures, as well as the algorithm can be used as reference learning!
数据结构课设
- 用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
软件工程设计最终完成
- 人事管理系统，软件工程课程设计，TC3下调试成功，采用链表结构，实现增加删除查询等功能，调用汉字库实现汉字输出-Personnel Management System, software engineering curriculum design, debug TC3 successfully used Chain structure, the added features such as deleted inquiries, call for Chinese exports Store
FixMath
- 这是我本人编写的一个32位定点小数运算的函数库。对于没有浮点运算器的场合，可以提供进行小数运算的一种途径-This is my prepared in a 32-bit fixed point decimal computing functions. For no floating point unit occasions, it can provide for fractional arithmetic, as a way to
图的操作界面
- 图邻接表的建立,深度优先遍历,.广度优先遍历,最小生成树,拓扑排序,单源点到其余各个顶点的最短路径等对图的操作!VC界面!-plans to establish the adjacent table, depth-first traversal. Breadth priority traversal, the minimum spanning tree, topological sorting, single-source all of the rest of the vertices such