搜索资源列表
mini-span-tree
- 关于最小生成树一些算法程序 对于数学建模 图论建模等方面有重要作用-Minimum spanning tree algorithm on a number of procedures for the mathematical modeling aspects of graph theory modeling plays an important role in
xq
- 图论中最短路算法，最小生成树，最大匹配与最佳匹配的算法，旅行商问题，求最大流的Ford--Fulkerson 标号算法-Shortest path graph algorithm, minimum spanning tree, the largest and best match matching algorithms, traveling salesman problem, maximum flow for the Ford- Fulkerson labeling algorithm
graph
- 根据现有图，实现求关键路径的算法，自己编写的，有什么问题请指教-Under the existing plan, the realization of the algorithm for critical path
FGseg
- a kind of Graph cuts algorithm
graph
- 现实生活中有很多关于流量的问题，比如说公路系统的车辆流，供水系统的水流，金融系统的金流等等。为了解决这些关于流量的问题，我们需要学习一系列关于流量的算法。-In real life there are many issues on the flow, such as road traffic flow system, water supply system, financial system, cash flow and so on. In order to solve these issues
follow
- 资料介绍了图论算法中最重要的定理之一的最小个最大流定理-Information on the graph theory algorithm, one of the most important theorem of the minimum of maximum flow theorem
109201262ruby_allocation3
- 算法图论-Algorithm for Graph Theory
A-Fusing-Color-and-Gradient-Features-Approach-to-R
- 本文通过融合图像的颜色和梯度特征 ,实现了一种实时背景减除方法。首先融合颜色和梯度特征建立新的能量函数 然后基于图切割算法最小化能量函数 ,并对前景P 背景进行分割 最后使用光流验证前景区域的真实性 ,并更新背景模型。- Based on the fusion of color and gradient features , this paper implement s a novel approach to real-time background subtraction.Firstly ,
transreversal_app
- 实现了一种图算法，在该图上有几个重要的操作，包括圈分解和圈相交判断-implements a graph algorithm, including some operations on graph,,,cycle incomposition and intersect, interleave.
GATSP
- 通过此程序能够利用遗传算法解决TSP问题，即图论中从某一点出发经过所有点一次的最短路径求解问题-Through this program can take advantage of genetic algorithm to solve the TSP problem, namely, graph theory starting from a point in time through all the points for solving the shortest path problem
Graphcoloring
- 采取邻接矩阵的搜索算法实现了对图的着色，是一种数值优化算法-Adjacency matrix to a search algorithm for graph coloring, is a numerical optimization algorithm
0021graphcut
- graph cut算法代码,希望给你有帮助-graph cut algorithm code, and want to give you help
Graph
- c写的贪心算法，利用指针来搜索最短路径，以及可以扩展成一般最短路径的求法-c write greedy algorithm, using a pointer to search for the shortest path, as well as the shortest path can be extended into a general law of demand
Graph
- 贪心算法 ；用到图结构，栈和队列来解决哈密顿回路；输出结果：路径（每条边及其权值），总和-Greedy algorithm use graph structure,stacks and queues to solve the Hamiltonian circuit output:path (each edge and the right value),the sum
Prims_Algorithm
- Prim s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the
Graph
- 图类：一个处理数据结构中图的基础类方法。这个类包括对图的最完整建模算法-Graphs: a graph data structure processing base class methods. This class includes the most complete modeling algorithm diagram
Regular PEG
- 此程序 是一个C++程序. 通过PEG算法来构造 LDPC parity-check 矩正的Tanner 图.-This is a C++ program, which is used to construct Tanner graph of LDPC codes with the famous PEG algorithm.
GraphGA-TabuHierarchicalLayout
- This article presents one of the most famous hierarchical graph drawing algorithms. Starting from a hierarchical graph we create a population of chromozoms that will be used in a Genetic Algorithm to get the best subjective representation: minimal ed
dijkstra
- Dijkstra s algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1959, is a graph search algorithm that solves the single-source shortest path
SimpleViterbi
- 此程序实现Viterbi快速算法，在概率图理论中应用-This procedure to achieve fast Viterbi algorithm, the application of graph theory in the probability