搜索资源列表
Shortest_Path
- 一个求单源最短路径的算法，即Dijkstra算法-One for single-source shortest path algorithm, Dijkstra algorithm that
Dijkstra1
- dijkstra算法实现最短路径的求法，仅供参考-dijkstra shortest path algorithm for the law, for reference only
classic
- 经典的matlab算法代码，包括顶点覆盖近似算法，哈密尔顿回路，最短路和次短路，最短路径等等。-Classical algorithm matlab code, including the vertex cover approximation algorithm, Hamilton circuit, the most short-circuit and sub-circuit, the shortest path and so on.
S030602102
- 赋权有向图中心问题 问题描述: 设G=(V,E)是一个赋权有向图，v是G的一个顶点， v的偏心距定义为： Max {w∈ V,从w到v的最短路径长度} G中偏心距最小的顶点称为G的中心。试利用Floyd 算法设计一个求赋权有向图中心的算法。-Empowering the central issue Digraph Problem Descr iption: Let G = (V, E) is a directed graph Empoweri
Floyd_Mini_Path
- 弗洛伊德算法求最短路径，适用于网络优化算法等应用-Freud for the shortest path algorithm for applications such as network optimization algorithms
oil
- 采用分治算法而编写的输油管道最短路径问题.-The shortest path of oil
floyd
- 图和网络最短路径法则的弗洛伊德算法，从振动论坛下载。挺不错的哟-Network map and the law of the shortest path algorithm Freud, from the vibration of the forum to download. Pretty good yo. .
GraphAlgorithms
- There are many algorithms that can be applied to graphs. Many of these are actually used in the real world, such as Dijkstra’s algorithm to find shortest paths. We will discuss a few here.-有很多算法，可用于图形。其中许多是实际使用在现实世界中， 如迪杰斯特拉算法寻找最短路径。将在这里讨论几个算法。
zuiduanlujing
- 以邻接矩阵为存储结构，实现弗洛伊德算法求解每一对顶点之间的最短路径及最短路径长度。-Adjacency matrix for storage in the structure of each algorithm for the realization of Freud on the shortest path between the vertex and the length of the shortest path.
Dijks-Shor-Path
- 实现了求最短路径的Dijkstra算法，方便操作，可以自已在程序界面上指定每一个点的位置，在界面上空白的地方每点击一下生成一个点-Achieved for the Dijkstra shortest path algorithm to facilitate the operation of their own in the program interface can be specified on the location of each point in the interface areas
Floyd
- 求多源最短路径的一个算法,编码风格清晰明了-Multi-source shortest path for an algorithm, coding style clear
zuiduanlujing
- 介绍图的最短路径的算法，在VC环境下运行过，简单实用-Plans to introduce the shortest path algorithm, running in the VC environment, the simple and practical
w
- 单原点最短路径问题算法，在这个问题中，给出有向图G，它的每条边都有一个非负的长度（耗费） a [i ][ j ]，路径的长度即为此路径所经过的边的长度之和。对于给定的源顶点s，需找出从它到图中其他任意顶点（称为目的）的最短路径。-Single-origin issue of the shortest path algorithm, in this issue, given directed graph G, each of which has a non-negative edge length
search
- 迷宫搜索 ，A*算法 ，自动生成迷宫矩阵，查找最短路径-Maze search, A* algorithm, automatic generation of matrix maze to find the shortest path
spfa
- 一个求最短路径的代码，用spfa算法做的-A shortest path for the code, spfa algorithm used to do
zong
- 这是数据结构c语言课本的几个常用算法代码。有广度和深度优先遍历。最小生成树，最短路径，拓扑排序。-This is the data structure of c language textbooks code of several commonly used algorithms. Have the breadth and depth-first traversal. Minimum spanning tree, shortest path, topological sort.
zxcvnjhjhkjk
- 最短路径----迪杰斯特拉算法这是用数据酷编写的超级还曾需飞行行分区地方人个还有就适合打击的假死优化哦----- Dijkstra shortest path algorithm which is used to prepare data super cool flight line had to be a district where there are suitable for people against the suspended animation optimization Oh
p3G19
- 数据结构（C）实现寻找最短路径的算法，配合文档说明-An algorithm for finding the shortest path in a graph
Dijkstra
- Dijkstra算法求单源最短路径 输入结点数关系数然后输入结点和其间的关及系权值，得出最短路径-Dijkstra algorithm for single-source shortest path relationship between the number of input nodes and then enter the node and which the Department of Customs and the right value, the shortest path ob
LL_Path_optimization
- 【系统功能】 LL-路径优化系统主要用于求解已知坐标的规模为N的城镇间最短路径问题。 【主要算法】 1：利用Prim算法求解带约束条件的连通图的最小生成树； 2：利用基于单亲遗传算法求解带约束条件的TSP问题。 -【Function】 LL-path optimization system is mainly used to solve the known coordinates for the N scale of the problem of the shortest p