-
abc
数据结构的稀疏矩阵的几部分操作,广工的课程设计(Sparse matrix operations)
- 2013-12-03 15:57:53下载
- 积分:1
-
InverseList
说明: 链表逆转,实现单链表的逆转程序,数据结构(List Inverse)
- 2011-04-04 11:15:58下载
- 积分:1
-
american_heritage
USACO中的American heritage,用C++编写,运用了树的遍历知识(the American heritage of USACO, with C++ prepared, using a tree traversal knowledge)
- 2013-07-21 18:31:10下载
- 积分:1
-
elevator
电梯模拟,实现一个模拟电梯的环境,用C程序实现的,封装良好(elevator modify)
- 2021-04-22 15:38:48下载
- 积分:1
-
BTree
排序二叉树(模板类),主要用于数据排序和查找。已在项目中使用(Sorted binary tree (template class), mainly used for data sorting and searching. Has been used in the project)
- 2010-10-09 13:49:44下载
- 积分:1
-
strcon
对于给定的n个字符串,请找出一种最佳的连接方式,使得采用该连接方式得到的字符串在所有连接的结果中,字典序最小(For a given n-string, find an optimal connection, making use of the connection string to get the results in all connections, the lexicographic minimum)
- 2011-09-02 16:52:40下载
- 积分:1
-
arrangement
假设要在足够多的会场里安排一批活动,并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点,不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数,相应于要找的最小会场数。)
对于给定的k 个待安排的活动,编程计算使用最少会场的时间表。
(Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.)
K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)
- 2014-10-22 11:00:45下载
- 积分:1
-
JOSEPHUS
一个关于约瑟夫环问题的经典算法编程的C语言实现(the program about JOSEPHUS)
- 2011-08-13 10:09:20下载
- 积分:1
-
chechang
数据结构作业-停车场管理(operating data structure-the car park management)
- 2020-06-26 11:00:02下载
- 积分:1
-
nuaa1108
说明: nuaa1108 多少连续的1 解题报告(Problem solving report
)
- 2009-08-23 10:01:05下载
- 积分:1