搜索资源列表
maxflow-v3.0.src.tar
- 图像处理最大流最小割经典算法,适合初学者使用！-A classic max flow/min cut algorithm in image processing
faulttree
- 简单的故障分析树程序，能够分析输入等式生成树形图形，有计算最小割集功能-Fault tree analysis of a simple process, be able to enter the equation analysis tree generated graphics, there is calculation of the minimum cut-set function
graph_cut
- 最大流最小割的代码，功能很好很强大，可以用在图形剪除这方面。-Maximum flow minimum cut of the code, very very powerful feature can be used to cut off this area in the graphics.
maxflow-v3.0
- 最大流或最小割问题的算法实现，采用graph cut方法做图像分割时需要用到最小割。-Maximum flow or minimum cut algorithm problem, the graph cut image segmentation methods need to use minimum cut.
match-v3.3.src
- 实现图像的匹配，用最大流最小割的算法实现-match
20090914
- 基于图割的能量最小化演示文稿。本人整理的，进一步理解图割理论的知识-Based on graph cut energy minimization of the presentation. I am finishing, and further understanding of the theory of knowledge in cutting plan
shiguerchashu
- 近年来，计算机辅助事故树分析方法发展很快，新的算法不断被提出。本论文根据《数据结构》［1］中的二叉树算法，结合事故树算法的特点，提出事故二叉树算法。通过建立事故二叉树及利用本文所介绍的一系列事故二叉树算法，不仅可以很方便地实现事故树定性分析中的最小割集和最小径集的求解,以及实现事故树定量分析中的顶上事件发生概率、各基本事件的概率重要度和临界重要度的求解，而且可以实现计算机辅助事故树绘图中的坐标计算问题。该算法是对事故树求解算法的有益的补充和发展，具有现实意义和广阔的应用前景。-In recent
3041
- poj 第3041_Asteroids题，最小顶点覆盖 网络流 最小割 邻接表-poj first 3041_Asteroids problem, minimum vertex cover network flow minimum cut adjacency list
blossom5-v2.01.src.tar
- 基于文献“一种新的最小割完美匹配算法”的最小割匹配算法-An implementation of a minimum cost perfect matching algorithm described in Blossom V: A new implementation of a minimum cost perfect matching algorithm. Vladimir Kolmogorov. To appear in Mathema
maxflow-v3.01.src.tar
- 基于文献“计算机视觉中的能量函数最小化的最小割/最大流”的最大流算法实现-An implementation of the maxflow algorithm described in An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Computer Vision. Yuri Boykov and Vladimir Kolmogorov.
zuixiaoge
- 最小割算法的一本电子书，和大家分享分享-ebook
maxflow-v2.21.src
- 最大流最小割算法的c++源代码,用于图像分割和处理领域-Minimum cut maximum flow algorithm c++ source code for image segmentation and processing
maxflow
- 最大流最小割算法的实现,能量最小化算法做分割,恢复等-max flow/min cut
graphcut
- Kmeans 聚类，graphcut 图像分割,最大流最小割算法-Kmeans clustering, graphcut image segmentation, the maximum flow minimum cut algorithm
graphcut
- 最大流最小割，用于图片分割以及与图片分割类似的网络问题-Maxflow/minium cut,used in graph cut or other similar problem
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
cut-the-minimum-cut-problem
- cut 最小割问题 网络G=(V,E)的割cut(S,T)是将G的顶点集V划分为2个不相交的子集S和T，使s Î S ， t Î T ，且cut(S,T) = {(u,v)Î E | u Î S,vÎ T}。设每条边(u,v)的边权为a(u,v),则割 cut(S,T)的权值为cut(S,T)中所有边权之和。最小割问题要求网络G 的权值最小的割。-cut the minimum cut problem network G = (V, E)
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
dijkstra
- 用于图像分割的dijkstra距离的计算，用于最大流最小割等算法-To dijkstra distance calculation used to image segmentation for the maximum flow minimum cut algorithm