搜索资源列表
graphAnalysisToolbox-1.0.tar
- 基于随机游走的图像分割，里面附有图论分析的工具箱，自己整合即可直接使用。-Image segmentation based on random walker, and we give a graphanalysis toolbox, the two combined and can be used for image segmentation
getAllPath_L
- 这是关于图论的内容，用于获得两点间的所有路径。-get path of two nodes
GBVS
- 基于视觉图论的运动目标检测识别，可以通过提取运动目标特征来检测运动目标-Visual graph theory based moving target detection and recognition, you can extract the moving target signatures to detect moving targets
algorithm-example-of-cPP
- 文件中包含一些常见的C++算法实例，包括数论算法、图论算法、背包问题、排序算法、高精度计算等一系列常见算法-Instance file contains some common c++ algorithm, including arithmetic algorithm, graph theory algorithm, knapsack problem, sorting algorithm, high accuracy calculation and a series of common algo
MATLAB-tulun
- 图论算法及其MATLAB实现 + 源代码_王海英_北航_2010-Graph theory algorithm and MATLAB+ source _ katerina _ buaa _2010
STDS
- 包括一些裸的图论代码，希望对初学者有所帮助-Some bare graph code, to help beginners
dijkstra
- Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法是很有代表性的最短路径算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。注意该算法要求图中不存在负权边。-Dijkstra (Dijkstra) algorithm is a typical single source shortest path algorithm for computi
Interactive---image-segmentation
- 本文提出的超像素渐进合并算法应用了图论的基本框架：一幅图像被映 射成一个加权的无向图，其中超像素被当作图中的顶点，而相邻超像素之间通过边 相连，由超像素间的相似度计算出相应边的权值，通过排序每次合并权值最小的两 个超像素。-Shot into a weighted undirected graph, including super pixels as the vertices in the graph, and the adjacent pixels by boundary betw
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
matgraph
- matlab的复杂网络的工具箱的说明书文件matgraph图论工具箱使用说明-matgraph tool paper
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
- 有关图论的知识，讲解比较基础，适合初学者-Knowledge about graph theory to explain the basis for comparison, suitable for beginners
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