-
最短路径c++语言
说明： 用从c＋＋写的floyd最短路径算法，可以求邻接矩阵任意两点的最短路径。(from using c++ to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.)
- 2020-09-20 14:07:55下载
- 积分：1
-
delete
数据结构 实验练习 删除相同的节点 希望会对大家有所帮助(Data structures lab exercises to remove the same node want to be helpful to everyone)
- 2012-11-14 12:59:15下载
- 积分：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
-
classical-algorithm-VCPP
常用的算法经典代码，包括快速排序，冒泡排序等各种排序方法，还有二叉树的前序、中序和后序遍历等(The classic algorithm code, including quick sort and bubble sort sorting methods, as well as the preamble of the binary tree, inorder and postorder traversal, etc.)
- 2013-01-15 11:15:10下载
- 积分：1
-
MyKD Tree
KD树算法，能够实现对点云数据进行压缩，非常简单，适用于初学者(KD tree algorithm, can achieve the point cloud data compression, very simple, suitable for beginners)
- 2015-06-24 20:10:33下载
- 积分：1
-
fml
已知二叉树的先序遍历结果，建立二叉树并输出其先序、中序、后序遍历结果(Build a binary tree and print the results of preorder, midorder and postorder traversals based on the known result of preorder traversal)
- 2015-02-15 15:20:26下载
- 积分：1
-
Prim
编程实现Prim算法，基于最小堆数据结构，生成最小代价生成树。
（其中随机生成点和边，形成连通图）
根据输入的顶点数的不同，分析时间复杂度。(Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree.
Generate weighted undirected complete graph for given size n according to the following approach:
1) Randomly generate n points ( ) on a plane
2) Randomly generate k pairs of points as edges of the graph.
3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge.
)
- 2011-06-11 16:28:53下载
- 积分：1
-
tanxinfangfa
说明： 贪心方法是一种改进了的分级处理方法。它首先根据题意，选取一种量度标准。然后按这种量度标准对这n个输入排序，并按排序一次输入一个量。如果这个输入和当前已构成在这种量度意义下的部分最优解加在一起不能产生一个可行解，则不把此解输入加到这部分解中。这种能够得到某种度量意义下的最优解的分级处理方法称为贪心方法。(greedy method is an improvement of the classification methods. According to its first title Italy, and a selection of standards of measurement. Then, under such a standard measure of this sort n input, with an input an order volume. If the input current and constitutes a measure of significance in this part of the optimal solution together not produce a feasible solution. this solution will not put this added to the importation of decomposition. This can be a meaningful measure of the optimal solution hierarchical method, known as greedy method.)
- 2006-05-15 21:50:01下载
- 积分：1
-
Maze
c++用栈来实现迷宫求解（c语言数据结构）(c++ stack maze solving (c language data structure))
- 2012-10-27 23:08:34下载
- 积分：1
-
Polynomial
Polynomial基于数据结构的思想,文件比较小,可以直接运行(Polynomial based on the idea of data structures, file is relatively small and can be run directly)
- 2013-12-11 11:05:18下载
- 积分：1
