搜索资源列表
强盗分金算法
- 10名海盗抢得了窖藏的100块金子，并打算瓜分 这些战利品。这是一些讲*的海盗（当然是他们自己特有的*），他们的习惯 是按下面的方式进行分配：最厉害的一名海盗提出分配方案，然后所有的海盗（包 括提出方案者本人）就此方案进行表决。如果50%或更多的海盗赞同此方案，此方 案就获得通过并据此分配战利品。否则提出方案的海盗将被扔到海里，然后下提名 最厉害的海盗又重复上述过程-10 pirates seize a
prj143
- 这是关与系统名称系统实施工作计划的内容-This the name of customs system and the implementation of the system of work plan
GreatScheduleControl
- 计划时间计算控件，可以把人性化的任务安排转换成任务执行的确切时间［控件］［代码］-plan, calculated in the time control, human nature and the mission of conversion arrangements mandate of the exact time [control] [code]
exp2 project
- 图像拼接 实现全景图的生成 要求为bmp图像 第一次上传 大家多多包涵-Panoramic Image Stitching realization of the plan calls for generating the first bmp image you upload excused
四份图拼图
- 在小游戏中将一幅图拆成四份，可以用鼠标拖动将四副图拼到底板上。-in a little game plan will be split into four copies, can use a computer mouse to drag Figure 4 fight in the end boards.
0801
- 功能：构造图，并进行图的深度优先遍历（邻接表存储结构），图的广度优先遍历，内附详尽的源代码说明-function : tectonic map, and map depth-first traversal of the (storage structure adjacent table), the breadth of the plan priority traversal, enclosing a detailed note of t
图的邻接表实现
- 图的邻接表示实现。用来在C++环境下实现图的邻接表示。（数据结构程序）-adjacent said of the plan to achieve. C environment for the realization of the plan under the adjacent said. (Data Structure procedure)
普里姆算法
- 利用prim算法来计算最小生成树,对于数据结构学习者有很大帮助,利用邻接矩阵来存储图-Prim algorithm used to calculate the minimum spanning tree, the data structure for the learner is very helpful to use the adjacency matrix storage plan
16.在有向图中查找由v1到v2的所有路径
- 建立一个有向图 给定任意2个顶点 求得两个顶点间的所有路径 然后打印 数据结构中有此例题-to establish a plan to set arbitrary vertex obtained two vertices between the two paths before all print data structure of this example
CFARzz
- CFAR代码，CFAR是用于雷达的一种滤波方法，称为平均值滤波，本程序给出了主程序以及CFAR-function，并且有噪音图和信号图，可以进行比较分析-CFAR code, CFAR radar for a filtering method, known as average filtering, the process is the main program and CFAR-function, and the noise and
tude遍历
- 图的遍历算法包括先序，后序，中序等多种遍历次序，还有图的初始化等-traversal algorithm of the plan include the first sequence after sequence, sequence and other traversal sequence, and there are also such as the initialization
guanjian
- c语言实现关键路径。预先设定图，可输入权值，希望能满足一些人需要-Critical Path. The pre-set plan, the right value to be imported, hoping to meet some people who need
自动打铃系统
- 自动打铃系统，在ＭＡＸＰＬＵＳ平台下动行，能实现计时、打铃控制等功能。 -automatic bell system, the Converter Platform animal, able to plan, a Bell controls.
Myumleditor_src
- 一个UML视图的编辑器，虽然比不上Rose，但基本的图能画了。-View of a UML editor, although behind Rose, but the basic plan will painting.
2002011827
- 使用的函数（非自己编写）：dib.cpp（附上）功能：1．BMP图的读写；2．画直方图；3. 存直方图；4．迭代算法求得阈值并进行二值化；5．任意输入并进行二值化（供比较）；6. 保存新图或者恢复原图。pS:Public类中的文件地址指针是全局变量。-use of the function (their preparation) : dib.cpp (attached) functions : 1. BMP map reading an
心电信号滤波
- 心电信号滤波，数字信号处理课后试验，其中有源程序，频谱图，滤波图-ECG filtering, digital signal processing OSCAR test, which is the source, the spectrum, filtering plan
t(OK)
- 该程序实现了图的先序、后序遍历和拓扑排序等，而且是界面输出。-the program to achieve the plan's first sequence, after the preorder and topological sorting, but it is the output interface.
longest
- 输入一个带权图的无向图，求出其中一个顶点到其它顶点最长的路径，并输出这条最长路径-input with a map without the right to plan, which sought a vertex to vertex other the longest path, and the output of the longest path.
5班8号周前平
- 输入一个有向图，用深度优先搜索，判断该图是否为一有圈的图。-importation of a directed graph, with the depth-first search to determine whether the plan is a map of the circle.
5班8号周前平第2题
- 单源最短路径问题。从文件中读入一个图，求一个顶点到其它所有顶点的最短路径。-single source shortest path problem. Reading from the document into a plan and seek a culmination of all the other vertices in the shortest path.