搜索资源列表
best_vertex_cut
- 图的基本应用，用于解决图的最有顶点割集，封装为模板，图用邻接矩阵表示-That the basic applications, used to solve most graph vertex cut set, package as a template, graph with adjacency matrix
test
- 利用剪切板切图（Alt+PrtScn），在QQ找茬游戏中画出不同部分-Cut graph using the clipboard (Alt+ PrtScn), finding fault in the QQ plot in different parts of the game
MNTH
- 在管理科学、计算机科学、分子物理学、生物学、超大规模集成电路设计、代码设计、图像处理和电子工程等领域中，存在着大量的组合优化问题。例如，货郎担问题、最大截问题、0—1背包问题、图着色问题、设备布局问题以及布线问题等，这些问题至今仍未找到多项式时间算法。-In management science, computer science, molecular physics, biology, VLSI design, code design, image processing and electro
fenzhijiexianfa
- 分支界限法是由“分支”和“界限”策略两个部分组成，其中“分支”策略是对问题空间按照广度优先的策略进行搜索；“限界”策略是为了加速搜索速度而采用启发信息剪枝的策略。 使用分支限界法来解决单源最短路径问题时主要利用结点控制关系剪枝，在一般情况下，如果解空间树中以结点Y为根的子树中所含的解优于以结点X为根的子树中所含的解，则结点Y控制了结点X，以被控制的结点X为根的子树可以剪去。算法实现时，使用邻接矩阵表示图，二维数组存储图的邻接矩阵，使用数组记录源到各顶点的距离和路径上的前驱顶点。 -Br
cc
- 经典图论，其中叙述了图论的经典算法等，如最大流、最小割等相关算法。-Classical graph theory, graph theory, which describes the classical algorithms, such as maximum flow, minimum cut, and other related algorithms.
GraphCut-tuge
- 自己搜集，图割的论文，代码以及重要的文献，适合新手学习-Own collection, graph paper cut, code, and important documents, suitable for beginners to learn
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
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
experiment_3[1]
- 计算阶跃折射率光纤传播常数、归一化频率、截止波长、导模数量等- Calculate for Step Index Fibers (using MATLAB): a) Propagation constant (β) b) Normalized propagation constant (b) c) V number (V) d) Check whether the fiber is single mode or multi mod
MinCut
- 实现最小割，基于图的图像分割算法，学习必备。-Minimum cut graph-based image segmentation algorithm, learning essential.
MinCut
- Computer global min-cut in a graph. Implements random contraction algorithm. Need to be run multiple time for better solutions.
GrTheory
- GrTheory - Graph Theory Toolbox. Functions: grBase - find all bases of digraph grCoBase - find all contrabases of digraph grCoCycleBasis - find all independent cut-sets for a connected graph grColEdge - solve the color problem for graph
GRAPH_CUT_STEREO_AA
- 全局立体匹配一直是一个比较困难的问题，本算法通过C++编译器，实现了全局立体匹配算法，希望对你有帮助-Stereo matching algorithm based on graph cuts, using the maximum flow/minimum cut methods to achieve global stereo matching.
maxflowmincut
- 基于图论的图像分割——最大流最小割算法。内含最大流最小割算法通用matlab程序。-Maximum flow minimum cut algorithm- based on graph theory image segmentation. Maximum flow minimum cut algorithm contains generic matlab program.
Edge-Detection
- 与以往关注图像局部特征和局部连续性的方法不同，本文中的方法能够提取关于图像的全局印象。为此，我们将图像分割问题转化为图划分问题并提出了划分中的一种全局判别准则——Ncut (Normalized Cut)-Concerned with the past image local characteristics and continuity of local methods, the methods herein can extract images on the overall impressio
modDRF.pdf
- In this paper we present Discriminative Random Fields (DRF), a discrim- inative framework for the classification of natural image regions by incor- porating neighborhood spatial dependencies in the labels as well as the observed data. The proposed mo
NcutImage
- Normalized Cut Image Segmentation Code，一种基于图的图像分割算法源代码，效果较好，但运行速度不是很高，可供图像分割初学者学习-Normalized Cut Image Segmentation Code, a graph based image segmentation algorithm
Stoer-Wagner
- 一个新的求图的最小割的方法，Stoer-Wagner能够求得最佳分割方式，而且其速度很快。 -A new method for the minimum cut of the graph, Stoer-Wagner is able to get the best segmentation method, and its speed is very fast.
Lazy_Grab_cut
- grab_cut,graph gut的进阶版，运用了lazy snapping-There are advanced segmentation algorithms in the literature which extends the concepts of graph cuts. Most prominent of them are Graph cuts and Lazy Snapping. Lazy napping is an interactive image cut out tool.
FindArt
- 求无向连通图的最小割点。用R.Tarjan发明的算法来实现的。该算法能够求出无向连通图中最小割点。-Seeking connected undirected graph minimum cut point. Algorithmically R.Tarjan invention to achieve. The algorithm can be obtained connected undirected graph minimum cut points.