资源列表
图的表示23
- 图的表示 数据结构-map indicates that the data structure
Gray Histogram
- Presents gray histogram of an image.
gongzuofenpei
- 设有n个件工作分配给n个人。将工作i分配给第j个人所学要的费用为Cij。试设计一个算法，为每个人都分配1件工作，并使总费用达到最小-With n-pieces of work assigned to the n individuals. Will be allocated to the first j of work i personally have learned to cost Cij. Try to design an algorithm for each person assigned
TopoSort
- 有向图 编写程序判断该图是否含有环 如没有则输出其拓扑序列-Digraph write a program to determine whether it contains any part of the plan if there is no sequence of the output of its topological
gavsteh
- 地球物理中的G-S变换，电磁场频率域变换到时间域。-Geophysics in the GS transformation, electromagnetic frequency domain transform to the time domain.
sanzhenchafa
- 三帧差法，用于分离背景图片及分析车流量的变化-Three difference method for the separation and analysis of the background image changes in traffic
Haffman
- 数据结构哈弗曼编码实验程序，能够完整实现其要求-Experimental data structure Hafu Man coding procedures to complete implementation of its requirements
maze-problem
- 实现迷宫问题的求解：以一个m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。-Achieve maze problem solving: a long-m* n matrix that maze, 0 and 1, respectively, in the maze of paths and obstacles. Design a program, for any set of the maze, find
cipher
- 置换密码。本程序没有把变换的矩阵解出来，而是通过数学变换，求得每一列最后的在位置，再求模得出密文。-Replacement password. This procedure did not change the matrix solution out, but by mathematical transformation, obtained in the final position of each column, then the modulus obtained ciphertext.
puzzle
- 能输入一个Ｎ*Ｍ矩阵代表迷宫分布，指定入口出口后，程序自动搜索从入口到出口的路径。-You can input a N*M matrix to represent a maze ,define an entrance and exit,this program will search the way from entrance to exit .
combinatation_dynamic
- 数据结构程序实例，动态规划法求组合数算法的实现-Data structure instance, the dynamic programming method to seek the realization of the number of combinations of algorithms
shadow22
- 含有阴影的车辆检测源代码 含有阴影的车辆检测源代码-The vehicle containing the shadow detection source code The vehicle containing the shadow detection source code