搜索资源列表
RW
- RW法是一种基于图论的多刚体建模方法。RW方法建立万向轴模型（包括演示动画程序） _simu为主程序、_ini初始参数、_end画图 一门课的作业，希望有人能用得上哈：）-RW is a method based on graph theory modeling of multi-body methods. RW method to establish universal shaft model (including the animation program) _simu the ma
graph
- 所有图论问题的MATLAB程序，包括最短路-MATLAB graph theory problem of all procedures, including the short-circuit, etc.
xujinpeng-matlab.rar
- 遗传算法编程求解旅行商问题；图论中最短路问题的Matlab程序实现；背包问题模型的Matlab程序实现。,Genetic Algorithm for Solving Traveling Salesman Problem programming graph theory, shortest path problem in the Matlab program implementation knapsack problem Matlab model implementation process.
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
GraphSegment.rar
- 基于OpenCV开发的基于图论的快速图像分割方法，可以选择分割使用的彩色空间，可以设置参数。,effcient graph-based image segmentation on different color spaces programmed on OpenCV.
GrTheory.rar
- 这是一个图论工具箱，内包含25个图论算法，包括最小路径规划，和旅行商问题。,This is a map of the toolbox, which contains 25 plans of algorithms, including the smallest path planning, and the traveling salesman problem.
Dijiska
- Dijiska算法，解决图论中的最短路径问题-Dijiska to solve the shortest path
Spanning-tree
- 利用图论中生成树的概念编写的全部生成树代码，由于缺少中间的实数编码遗传算法代码，所以还不能得出完整的结果，但整个程序框架是正确的！-Spanning tree in graph theory using the concept of writing all the spanning tree code, the lack of the middle of the real-coded genetic algorithm code, so it can not come to a complete
22
- 用计算机实现图论中的最短路径程序-Computer realization of graph theory in the shortest path procedures
gaplotchange1
- 由于求解中国邮递员、优化等图论问题的Matlab程序，还有相关的工具箱。-Since solving the Chinese postman, graph theory and optimization problems in Matlab, as well as the associated toolbox.
floyd
- 用于求解图论的最短路径问题,求解图论网络中任意两点的最短距离！-Floyd for the shortest problem.
matlab_bgl
- 图论工具箱，包括图论的相关操作，求最短路径，搜索，匹配，最大流，核数等-matlab graph toolbox
floyed
- 这是一个图论经典程序。 图论最短路径的Floyd算法，供大家参考。-This is a classic graph theory program. Graph theory Floyd algorithm of the shortest path, for your reference.
Nystrom-Ncut
- 图论分割算法之一“Nystrom Ncut”MatLAB源程序。-MatLAB codeof “Nystrom Ncut”.
Folyd
- 弗洛伊德算法，图论，图的遍历，对初学者有用-Floyd algorithm, graph theory, graph traversal, useful for beginners
graph
- 图论的算法，最短路，最小生成树，连通，匹配，网络流及应用。-Graph theory, algorithms, shortest path, minimum spanning tree, connectivity, matching, network flow and applications.
template
- ACM及各类基本算法模板，包括数据结构，计算几何，字符串，图论，数学，高精度等许多常用模板-ACM basic algorithm and various templates, including data structures, computational geometry, string, graph theory, mathematics, high-precision, and many other commonly used templates
flody
- 图论算法 求SAP矩阵的基本思想是图的最短路的问题。 由于铁路的运输费用与线路的长度不是线性关系，必须对铁路网做一些预处理才能套用图的标准最短算法。 -SAP matrix graph theory algorithm for getting the basic idea is to map the shortest path problem. Since the railway transport costs and the length of line is not a line
min_tree
- Kruskal算法的M程序，主要用于图论问题。最终求出要求的最小树问题。-Kruskal algorithm M program, mainly for graph theory problems. Eventually find the required minimum tree problem.