网站首页

登录

elevator

于 2021-04-22 发布文件大小:899KB

 0  284

下载积分: 1 下载次数: 6

我要下载

代码说明：

电梯模拟，实现一个模拟电梯的环境，用C程序实现的，封装良好(elevator modify)

文件列表：

电梯模拟
........\Bell.cpp,493,2007-03-03
........\Bell.h,489,2007-03-03
........\Building.cpp,5178,2007-04-26
........\Building.h,971,2007-04-26
........\Button.cpp,799,2007-02-26
........\Button.h,706,2007-02-23
........\DataInfo.h,828,2007-03-03
........\DateInfo.h,53,2007-02-22
........\Debug
........\.....\Bell.obj,35823,2008-04-12
........\.....\Building.obj,286151,2008-04-12
........\.....\Button.obj,147560,2008-04-12
........\.....\Door.obj,40533,2008-04-12
........\.....\Elevator.obj,210061,2008-04-12
........\.....\Floor.obj,189281,2008-04-12
........\.....\Light.obj,41130,2008-04-12
........\.....\Main.obj,205745,2008-04-12
........\.....\People.obj,43643,2008-04-12
........\.....\Time.obj,5825,2008-04-12
........\.....\vc60.idb,132096,2008-04-12
........\.....\vc60.pdb,151552,2008-04-12
........\.....\模拟电梯.exe,659563,2008-04-12
........\.....\模拟电梯.ilk,995436,2008-04-12
........\.....\模拟电梯.pch,192404,2008-04-12
........\.....\模拟电梯.pdb,1229824,2008-04-12
........\Door.cpp,533,2007-03-03
........\Door.h,505,2007-02-19
........\Elevator.cpp,3774,2007-04-26
........\Elevator.h,1778,2007-04-26
........\Floor.cpp,3239,2007-04-26
........\Floor.h,1040,2007-04-26
........\Light.cpp,653,2007-02-26
........\Light.h,570,2007-02-19
........\Main.cpp,4026,2007-04-26
........\People.cpp,1392,2007-04-26
........\People.h,742,2007-02-26
........\Time.cpp,1107,2007-03-03
........\Time.h,620,2007-03-03
........\模拟电梯.dsp,5497,2007-02-26
........\模拟电梯.dsw,541,2007-02-19
........\模拟电梯.ncb,107520,2008-04-12
........\模拟电梯.opt,48640,2008-04-12
........\模拟电梯.plg,2374,2008-04-12
........\模拟电梯.sln,888,2007-04-26
........\模拟电梯.vcproj,9300,2007-04-26
........\模拟电梯.vcproj.WANGJIANYOU.wjyou.user,1419,2007-04-26
........\说明.txt,450,2007-02-25

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

xianxingbiaolianjie
线性表的链接实现可利用单链表来实现，每个节点存储一个元素。利用单链表来实现线性表的元素的插入，删除，修改等功能。 (Linear link table can be used to achieve a single linked list to implement, each node stores an element. Using a single linked list to implement elements of the linear table insert, delete, modify, and other functions.)

2011-04-26 11:57:25下载

积分：1
suanfa
插入排序与合并排序的算法比较，比较两种算法的优劣(Comparison of insertion sort and merge)

2011-12-13 22:28:33下载

积分：1
beipaowenti
背包算法的c++简单实现，很有用的，可以看看(Knapsack algorithm)

2012-04-10 19:32:41下载

积分：1
Lecture7
数据结构中插入排序，堆栈排序等的用法还有希尔排序(Data structure insertion sort, stack, sort, etc. use well sorted Hill)

2011-07-27 15:31:31下载

积分：1
maze
迷宫求解一般采用“穷举法”，逐一沿顺时针方向查找相邻块（一共四块－东(右)、南(下)，西(左)、北(上)）是否可通，即该相邻块既是通道块，且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)

2013-12-13 17:55:45下载

积分：1
有向图的邻接表存储的实现graph
有向图的邻接表存储的实现，包括有向图的各种操作(Directed graph adjacency list storage implementation, including a variety of operations to the map)

2020-07-16 10:38:50下载

积分：1
jiajianfa
长整数四则运算,利用双向循环链表实现长整数的存储，每个结点含一个整形变量。 (Long integer arithmetic, the use of two-way circular linked list to achieve long integer storage, each node contains an integer variable.)

2014-05-29 14:41:51下载

积分：1
约瑟夫环的循环链表实现
约瑟夫环的循环链表实现，这个程序比较完整，有需要做试验的请速速下载。(Josephus cycle Chain achieved, the procedure is complete, the pilot needs to be done urgently requested to download.)

2005-07-03 19:38:38下载

积分：1
zuixiaoshengchengshu
最小生成树C语言程序，提供给喜欢编程以及数学建模的同学(Minimum spanning tree C language program)

2015-02-08 20:15:45下载

积分：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

696516资源总数
106914会员总数
0今日下载