-
Map-four-staining
用不多于四种颜色为地图染色,使相邻的行政区不重色,是计算机科学中著名的“四染色”的典型应用,应用这个思想,是以回溯的算法对一幅给定的地图染色。是对数据结构中栈的应用。(With no more than four colors map staining the adjacent borough is not heavy color, typical applications of computer science "stain" the application of this idea, a backtracking algorithm on a given mapstaining. The application of the stack data structure.)
- 2012-12-05 13:20:37下载
- 积分:1
-
bintree
一个关于二叉树应用的小程序,包括二叉树的建立,前中后遍历等操作(a program about bintree structure)
- 2009-05-17 16:54:29下载
- 积分:1
-
yuyundonghui
参加运动会的 个学校编号为 。比赛分成 个男子项目和 个女子项目,项目编号分别为 和 。由于各项目参加人数差别较大,有些项目取前五名,得分顺序为7,5,3,2,1;还有些项目只取前三名,得分顺序为5,3,2。写一个统计程序产生各种成绩单和得分报表。
2、要求产生各学校的成绩单,内容包括各校所取得的每项成绩的项目号、名次(成绩)、姓名和得分;产生团体总分报表,内容包括校号、男子团体总分、女子团体总分和团体总分。
3、测试数据:对于 , , ,编号为奇数的项目取前五名,编号为偶数的项目取前三名,设计一组实例数据。
(The school serial number participating in Games is. Competition divides into men s event and women s event , the project serial number parts for the sum. The difference is bigger since every project participates in a number , some projects choose the first five , score order is 7 , 5 , 3 , 2 , 1 Still have some of projects taking the first three places , score only being 5 , 3 , 2 in proper order. Write a form for report counting procedure producing the various school report card and score. 2, demands the school report card producing every school , content includes every achievement project number , position in a name list (achievement) , full name and score per got by school Produce the group total points form for report , content including the school number , male person group total points , woman group total points and group total points. 3, testing data: Be that the odd number project chooses the first five to the serial number, the serial number is that the even number project c)
- 2009-04-07 22:40:37下载
- 积分:1
-
beipaowenti
背包算法的c++简单实现,很有用的,可以看看(Knapsack algorithm)
- 2012-04-10 19:32:41下载
- 积分:1
-
14160_1239592890aB1K
纯C语言写的小型通用数据库,一个C数据结构组科技小组的作品,附有开发思路PPT,这可是一个宝贵的资源哦,更底层的东西,运行于DOS提示符,可以新建数据库等操作。C的编程高手们值得参考一下。
(Pure C language to write a small general-purpose database, a data structure C Group Technology Group works to develop ideas with PPT, this is a valuable resource Oh, and the bottom of things, running on the DOS prompt, you can operate a new database. C programming masters worthy of reference.)
- 2009-04-13 12:50:21下载
- 积分:1
-
shopping-question
实现超市中排队购物用时最短,是计算机算法设计与分析中的一道题。自己写的程序,原创!(Achieve queued supermarket shopping with the shortest, is a question in the design and analysis of computer algorithms. Write their own procedures, original!)
- 2012-08-18 11:01:09下载
- 积分:1
-
Figure-topological-sort
说明: 拓扑排序
对一个 有向无环图 G进行拓扑排序,是将G中所有顶点排成一个线性序列,使得图中任
意一对顶点u和v,若u,v ∈E,则u在线性序列中出现在v之前。
通常,这样的线性序列称为满足拓扑次序的序列,简称 拓扑序列 。
注意:
①若将图中顶点按拓扑次序排成一行,则图中所有的有向边均是从左指向右的。
②若图中存在有向环,则不可能使顶点满足拓扑次序。
③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort
In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post
Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before.
Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence.
Note:
(1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing.
(2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence.
(3) a DAG topological sequence usually expressed some scheme is feasible.
)
- 2011-03-22 17:19:14下载
- 积分:1
-
migong
迷宫算法,1代表可以通过,0代表墙壁,自动找寻路线(Maze algorithm, 1 can pass 0 for the walls, automatically find routes)
- 2011-06-11 17:13:39下载
- 积分:1
-
BinaryTree
数据结构使用三叉链表表示的二叉树的基本操作(Data structures using the binary tree expressed in the trigeminal lists the basic operation of)
- 2010-06-26 10:51:43下载
- 积分:1
-
12
说明: c编写的链表连接函数,上课时学的,上传试试 (c write the list to connect function, class, learn, try uploading)
- 2010-07-08 15:27:22下载
- 积分:1