搜索资源列表
dxcl
- 单元最短路径算法，又称迪杰斯特拉算法，是图论中的经典算法-Unit shortest path algorithm, also known as the Dijkstra algorithm is a classical algorithm in graph theory
MinCut
- Computer global min-cut in a graph. Implements random contraction algorithm. Need to be run multiple time for better solutions.
max_min_segment
- 最大流/最小割方法。为学习图像处理中的图割算法做准备，算法思想是Ford-Fulkerson方法。最大流是一个有向图，最小割就是网络中所有割中值最小的那个割。 -Maximum flow/minimum cut method. As a learning image processing to prepare graph cut algorithm, the algorithm idea is Ford-Fulkerson method.
Dijkstra
- 单源最短路径Dijkstra。使用图论算法作为图像处理的基础算法，Dijkstra和Bellman-Ford类似，都是解决单源最短路径问题，不同的是这个方法只能解决边为非负的问题，实现的好的Dijkstra算法运行时间要快于Bellman-ford。-Single source shortest path Dijkstra. Using graph theory algorithm as the basis of image processing algorithms, Dijkstra and
psf
- FieldII关于聚焦算法的例程，共含有8种不同的的聚焦情况，给出了不同聚焦深度及不同焦点的仿真图。-FieldII on the focusing algorithm routines, containing a total of 8 different focusing conditions, different depth of focus and different focus of the simulation graph.
dijkstra
- dijkstra算法，主要用来解决图论中的最短路径问题，适用于起始点已经给定。-dijkstra algorithm, graph theory is mainly used to solve the shortest path problem, for the starting point has been given.
floyd
- floyd算法，主要用来解决图论中的最短路径问题，可以求解任意两点间最短路径。-floyd algorithm, graph theory is mainly used to solve the shortest path problem, you can solve the shortest path between any two points.
maximalCliques
- 求最大团的算法，Bron-Kerbosch 算法计算图的最大全连通分量(团clique)，matlab实现-Seeking maximum clique algorithm, Bron-Kerbosch algorithm to calculate the maximum fully connected graph component (group clique), matlab achieve
Project_BFS
- 任务：用BFS或是DFS对图进行搜索，实现任何拓扑不连通的块的计算，算法要求写在CBFSSearch类中 工程名：Project_BFS 要求：对于生成的任意拓扑，求出其分枝个数，并输出每个分枝的节点 -Task: Using BFS or DFS for searching the graph to achieve any topology unconnected blocks calculation algorithm requires written in CBFS
lujing
- 蚁群算法 TSP商旅问题 最优路径 最短路问题-Ant colony algorithm TSP business problems The optimal path The shortest path problem The application of graph theory
zuiduan
- 设图的顶点大于1个，不超过30个，每个顶点用一个编号表示（如果一个图有n个顶点，则它们的编号分别为0, 1, 2, 3, …, n-1）。 此题为求有向网中顶点间最短路径问题，可建立以票价为权的邻接矩阵，用Dijkstra算法求最短路径长度。 Dijkstra算法中有一个辅助向量D，表示当前所找到的从源点到其它点的最短路径长度。因为每次都要在D中找最小值，为提高性能，用最小值堆的优先队列存储D值。 -Let the vertex is greater than 1, no more
TSP
- cost存放了一个强连通图的边权矩阵，作为一个实例。 可在workspace中加载 运用此算法要注意多次试验。-storage cost of a strongly connected graph edge weight matrix, as an example. Loaded in the workspace using this algorithm is to pay attention to several tests.
fahtnytemudm
- 这是一个使用图割算法实现的图像分割程序自动加手动实现精确分割。-This is a graph cut algorithm using image segmentation program automatically added manually to achieve accurate segmentation.
find_circle
- 关于图论与网络流中的一种有效的可实现的找圈算法-On graph theory and network flow in an efficient algorithm can be implemented to find ring
mini_tree
- 关于图论与网络流中的一种有效的可实现的寻找最短路树形图算法-On graph theory and network flow in an effective achievable short tree algorithm to find the most
shortest_path
- 关于图论与网络流当中一种有效的寻找最短树形图的算法-On graph theory and network flow in an effective achievable short tree algorithm to find the most
sim_two
- 关于图论与网络流当中一种有效的可用于连接俩个子图的算法-On graph theory and network flow which can be used to connect an efficient algorithm for two sub-graphs
TSP-Simulated-Annealing
- 本程序提供了多种TSP模拟退火算法解决图论问题的代码。-This program offers a variety of simulated annealing algorithm to solve TSP graph theory problem code.
Dijkstra
- 计算无向图中，从某一点出发到其余各点距离之和的最小值。应用Dijkstra算法完成。输入格式为，先输入两个数字N和M，N为顶点个数；之后输入M行数据，每行数据为两个顶点号以及顶点之间的距离。-Calculating an undirected graph, starting from a point to the rest of the points and the minimum distance. Application of Dijkstra' s algorithm is comp
pf-segmentation-master
- Matlab interface for the image segmentation algorithm of Efficient Graph-Based Image Segmentation Pedro F. Felzenszwalb and Daniel P. Huttenlocher International Journal of Computer Vision, 59(2) September 2004. -Matlab interface for the i