-
Kruskal
克鲁斯卡尔算法思想.cpp
int seekedge(EDGE * (&a), int n)
void bubble(EDGE * (&a), int size)
void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针，a2是最小生成树边集的头指针，k为所要删的边
void storepicture(EDGE * (&a), int n, VERTEX *b, int m) (Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) )
- 2009-06-27 01:43:39下载
- 积分：1
-
test
矩阵运算器，c语言编程，数据结构，免费下载(Matrix calculator, c language programming, data structures, free download)
- 2008-05-04 09:32:59下载
- 积分：1
-
qiongju
八皇后算法，用的是最简单的穷举法，在VC++6.0上编写的。(Eight Queens algorithm, using the simplest method of exhaustion, in VC++6.0 written on.)
- 2013-08-14 22:21:28下载
- 积分：1
-
communication
VC简易通讯录，加强C的编程，熟悉链表文件的使用等。(Simple VC contacts, strengthen C programming, familiar with the use of a linked list file.)
- 2012-09-02 17:11:12下载
- 积分：1
-
zuiyouerfenjiansuozhu
最优二叉搜索树问题具有最优子结构性质，即其任意一棵子树都是一棵独立的最优二叉搜索树，所以可以采用动态规划方法，并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)
- 2013-10-10 18:48:17下载
- 积分：1
-
ahuangCD
这个是数据结构课程设计中阿黄的CD的程序代码的工程文件包(This is a data structure curriculum design A yellow CD program code works package)
- 2013-12-21 18:53:00下载
- 积分：1
-
Huffman
数据结构，利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)
- 2014-01-28 18:25:24下载
- 积分：1
-
structure-array-code
根据队列搜索算法的基本思想，现设计了一个简单的结构体数组如下定义代码所示。此结构体数组具备控制结点搜索和存储结点信息和路径的功能，可以较好的实现TDN的最小时间路径搜索。(Search algorithm based on the basic idea of the queue is now designed a simple structure array as defined code. This structure array with the control node and storage node information search and path functions, you can achieve better TDN minimum time path search.)
- 2013-10-09 14:35:43下载
- 积分：1
-
Task1-trial--10211281--zly
描述：足球俱乐部包括球员、普通行政人员。球员有姓名、年龄、能力、年薪、转会费、进球总数、服役年限等重要参数；普通行政人员有姓名、年龄、能力、年薪等参数。你需要给相关管理机构开发一个管理程序，实现对众多足球俱乐部管理的基本功能。具体功能包括：
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 10:09:29下载
- 积分：1
-
basika
经典算法巴斯卡三角的简单实现，vs2010编译通过(Simple implementation of the classic algorithm Pascal triangle, vs2010 compiled by)
- 2012-10-30 13:22:26下载
- 积分：1
