搜索资源列表
matlab_bgl
- 图论基本函数库,函数相当丰富.包含 图论工具箱、基本图论函数库、Dijkstra最短路径、Kruskal最小生成树-The MATLABBGL library fills a hole in Matlab s suite of algorithms. Namely, it provides a rich set of algorithms to work with graphs, as in graph theory graphs. The MatlabBGL package uses Ma
sam
- 旅行商问题可描述为：商品的推销员打算从驻地出发遍访他要去的每个城市，并且每个城市只能访问一次，最后必须返回出发城市。问如何安排他对这些城市的访问次序,可使其旅行路线的总长度最短？用图论的术语来说，旅行商问题就是在赋权完全图上找一个权最小的Hamilotn圈[4]。-Traveling salesman problem can be described as: the salesman intends to start the station to visit each city he want
knn.tar
- KNN是采用分而治之方法计算K-最近图论的快速算法程序-KNNis is a fast algorithm for computing K-nearest neighbors graphs
image-segmentation-algorithm
- 针对图像分割应用中阈值难以确定的问题，提出一种基于图论的图像分割算法-In view of the image segmentation threshold is difficult to determine the problems in the application, put forward a kind of image segmentation algorithm based on graph theory
Chinas-postal-problem
- 计算机离散数学-图论-中的中国邮路问题的一种解决方案，可在dev，VC下调试成功-Computer discrete mathematics- China postal problem in graph theory, a solution, can be in dev, VC debugging success
graphcut
- graphcut的源码，基于graphcut的图像分割方法，基于图论的图像分割算法matlab实例-graphcut source, based on image segmentation method graphcut, and graph theory based image segmentation algorithm matlab examples
Fourteenth_shangji_9_10
- 图论，迪杰斯特拉，克鲁斯卡尔，弗洛伊德，拓扑排序算法，与大连理工大学软件学院课本代码相同并修正bug-Graph theory, Dijkstra, Kruskal, Freud, topological sorting algorithm, and Dalian University of Technology as textbooks with the same code and bug fixes
graph-theory-algorithm-MATLAB-code
- 图论算法及其MATLAB 程序代码,包含了常用的图论算法，如：最短路径算法。-Graph algorithms and MATLAB code, including commonly used graph theory algorithms, such as: shortest path algorithm.
MinimumCostFlow
- 图论中，已知费用矩阵和容量矩阵的情况下，求最小费用最大流问题-In graph theory, the problem of minimum cost maximum flow is obtained in the case of known cost matrix and capacity matrix.
floyd
- matlab计算图论中最短路径的floyd算法的matlab算法程序，包含最短经过路径的计算-floyd algorithm matlab graph theory to calculate the shortest path algorithm matlab procedures, including through the shortest path is calculated
Hamiltom
- 图论中计算Hamilton圈的lingo算法程序实例-Graph theory algorithms to calculate Hamilton Circle lingo instance
path-selection
- 图论中有关路径选取的程序， 主要涉及带有权值的最短路径搜索和次短路搜索-Graph theory about the path chosen program, mainly related to short-circuit the shortest path search and search with the right to sub-values
multi-trans-simple
- 此matlab程序用于将图论中的多重图变化为简单图-aim at trans multi graph to simple graph
boost-graph
- boost图论算法调用模板，只需要修改个别参数，就可以直接套用代码，省的自己实现-boost graph algorithms call template, only need to modify individual parameters, you can directly apply the code, to achieve their own province
Data-Struction--
- 《数据结构》图论部分的代码，主要关于交通图的代码撰写。-《Data Struction》
incidence-matrix
- 在data表格中输入电网络中图论的节点、支路、阻抗等信息，程序将自动生成关联矩阵。-Enter the electric network graph theory in the data table nodes, branches, impedance and other information, the program will automatically generate the correlation matrix.
GT
- 最大流算法，图论，运行可得最优线路问题的解答-Maximum flow algorithms, graph theory, running can get optimal line answers to questions
Hk_9
- 图论中的最小生成树(MST)算法，源代码。函数入口为Main-MST algorithms sourse code
mine-route
- 最短路算法,用于图论与网络中,数学建模中常用的程序-The shortest path algorithm for graph theory and network, mathematical modeling of the commonly used procedures
GrTheory
- 图论中的源代码，可以适用于图论的数值求解-Graph theory of the source code, can be applied to the numerical solution of graph theory