搜索资源列表
fuc
- 破圈法，边割法，避圈法的比较： 当图为连通且边树较少时，用破圈法较好 当图边数较多时，使用边割法和避圈法较好 -breaking lap, cutting edge, avoiding the comparison circle : When map is connected and fewer side tree, breaking lap with a better method when the edges of a few more, the use of cut
stream
- 网络流算法 涉及：数据结构(图论)、算法、ACM 分类有最大流、最小费用最大流、最小割
cut
- 无向图的最大割:对于给定的无向图G，设计一个优先队列式分支限界法，计算G的最大割。
z1
- 割图程序 图片能换，用来在game中取图， 分割为小图。 ＝＝＝＝＝＝＝＝＝＝＝＝ kal.chiname.cn-cutting plans can get pictures procedure, which used to take in the game plan, divided into small map. ============ Kal.chiname.cn
GraphAlgorithm.rar
- C++语言下, 关于图论算法的一些模版, 包括一般图最大匹配, km匹配, 最小割等等, 共15个模版,C++ language under the graph theory algorithm on a number of templates, including the maximum matching in general graph, km matching, minimum cut, etc., a total of 15 templates
3352
- poj3352给一个图,求出需要加最少的边使去掉任一条边,图都连通.割点的应用-poj3352 to a map, obtained at least the need to remove the edges so that any one side, map are connected. cut-point application
Algorithms
- 压缩包中包括几个常用算法对应的POJ练习题的实现，包括，无向图的欧拉回路，点的割集，TRIE树，最优比率生成树，最小树形图-Compressed package includes several commonly used algorithms POJ corresponds to the realization of exercises, including, undirected graph of the Euler circuit, point cut sets, TRIE tree, t
59tt460Grtyt
- 割图的算法，国际上正流行的图像分割方法，希望对大家有帮助-Cut graph algorithms, the international community is a popular image segmentation method, we want to help
22234142352006362052172495293
- 针对复杂背景的车牌定位问题, 提出了一种颜色和纹理分析相结合的车牌定位算法. 该算法采用基于适 合彩色图象相似性比较的HSV 颜色模型, 首先在颜色空间进行距离和相似度计算 然后对输入图象进行颜色分 割, 只有满足车牌颜色特性的区域, 才进入下一步的处理 最后再利用纹理及结构特征对分割出的颜色区域进行分 析和进一步判断, 并确定车牌区域. 该方法不同于大多数的车牌定位方法-License plate location for the complex background proble
best_edge
- 图论的标准应用解决边割集问题，模板输出最优边割集，图用邻接矩阵表示-The standard application of graph theory to solve the problem edge cut set, the optimal edge-cut set of template output, with adjacency matrix graph
best_vertex_cut
- 图的基本应用，用于解决图的最有顶点割集，封装为模板，图用邻接矩阵表示-That the basic applications, used to solve most graph vertex cut set, package as a template, graph with adjacency matrix
ed5
- 图论中桥的搜索，可搜索到一整个图中的桥，即割边- search the bridge
cc
- 经典图论，其中叙述了图论的经典算法等，如最大流、最小割等相关算法。-Classical graph theory, graph theory, which describes the classical algorithms, such as maximum flow, minimum cut, and other related algorithms.
MaxFlow
- 最大流最小割 可以测试某一个特定的图 也可以随机生成n个顶点的图和k条边 用来分析时间复杂度-Maximum flow minimum cut to test a particular map can also be randomly generated graph of n vertices and k edges used to analyze the time complexity
regionpushrelabel-v1.01
- 适用于大型网格图的最大流最小割算法，适合初学者-The regionpushrelabel-v1.03 library computes max-flow/min-cut on huge N-dimensional grid-graphs in graphics, vision, and medical imaging. The C++ implementation is designed specifically for multi-core systems and graphs larger
vc-tuxiangchuli
- 本书介绍了各种数字图像处理的算法及编程实现技术。全书由13 章和一个附录组成。主要内容包括: 位图基础、图像的显示、图像的几何变换、图像灰度变换、图像的平滑处理、图像锐化处理及边缘检测、图像分 割及测量、图像的形态处理学、图像的变换域处理及应用、图像的合成、24 位彩色图像的处理、图像的小波变 换和JPEG 图像的压缩编码。-This book presents a variety of digital image processing algorithms and programm
ArticPoints
- 求解无向图中的割点，返回该图中所有的割点-to find the articpoints in undirected graph,which returns all the articpoints
PicThery
- 这个程序实现与Matlab的优化工具箱下，用于给图进行边着色。包含了很多图论的程序，如计算最大割集、连通度、最小覆盖边数等等…… -This program is implemented with Matlab Optimization Toolbox for graph edge coloring. Contains a lot of graph theory program, such as the calculation of the maximum cut sets, connect
MinCut
- 实现最小割，基于图的图像分割算法，学习必备。-Minimum cut graph-based image segmentation algorithm, learning essential.
data
- 本算法是利用深度优先算法求图的全部割点，此外，也可以判断该图是否存在割点。-This algorithm is the use of depth-first algorithm for drawing all the cut points, in addition, can also determine whether the figure cut point.