搜索资源列表
DataStructureCourse
- 数据结构课程的单源点最短距离问题，对上数据结构的同学有帮助-Data Structure Course single source shortest distance problem, the data structure help students
DIJSTRA
- Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。-Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm for computing a node to all other nodes of the shortest path.
shortestpaths
- 本算法利用单源点的最短路径算法更改而成，输入输出是利用一个额外的数组来储存单源点的结点集。-The algorithm uses a single source shortest path algorithm change is made, input and output is to use an additional array to store a single set of source nodes.
suanfa
- 用贪心算法解决单源点最短路径问题并打印出任意两点的具体路径（C语言实现）-With a greedy algorithm to solve single-source shortest path problem and print out the specific path between any two points (C language)
Dijkstra
- C++实现求单源最短路径，可以由用户自己构造有向无环图-C++, find single-source shortest path can be constructed by the users themselves have directed acyclic graph
theshortestpath
- 用分支限界搜索法求解单源最短路径问题的算法-Branch and bound search method with a single-source shortest path algorithm
130572
- 单源最短路径问题的动态规划算法 输入要求：结点数目n，图的邻接表结点的数据 输出要求： 第一行：原点s到终点t的最短路径长度 第二行：最短路径之一，如：6 5 3 1 0 第三行：最短路径之二，… -Single-source shortest path problem requires the dynamic programming algorithm input: the number of nodes
ShortestPath
- 本程序是使用动态规划算法来解决单源最短路径问题。使用时，先输入每个头结点的邻接顶点个数，然后输入每个邻接顶点的数据。-This procedure is to use the dynamic programming algorithm to solve the single-source shortest path problem. When used, enter each of the first number of vertices adjacent node, and then ente
zuiduanlujing
- 单源最短路径，单目标最短路径，单顶点对最短路径间等算法-Single-source shortest path, single target shortest path between one vertex on the shortest path algorithms such as
TrafficCommand
- 建立交通网络图的存储结构 解决单源最短路径问题(Dijkstra算法) 实现两个城市之间的最短路径的问题 用MFC实现可视化菜单界面，使操作更加人性化，包括启动界面、图标、背景、按钮、界面框架等设计-Established transportation network graph structure to solve the storage problem of single-source shortest path (Dijkstra algorithm) to achieve t
cipan
- 磁盘调度算法 包括fcfs,最短寻道时间，电梯调度，单项扫描 -Disk scheduling algorithms include fcfs, shortest seek time, elevator scheduling, single scan
ford.c
- Ford algorithms trees The Bellman–Ford algorithm computes single-source shortest paths in a weighted digraph. For graphs with only non-negative edge weights, the faster Dijkstra s algorithm also solves the problem. Thus, Bellman–Ford is used primar
New-Text-Document-(2)
- 用Dijkstra算法求单源最短路径 输入参量ma是距离矩阵 输出参量是一个三行n列矩阵，每列表示顶点号及顶点到源的最短距离和前顶点-With a single-source Dijkstra shortest path algorithm for getting the input parameter ma is the output parameter from the matrix is a matrix of three rows of n columns, each colum
Europe-by-Rail
- 有关数据结构中的图的单源最短路径问题，以欧洲铁路图为原型-Map the data structure of single source shortest path problem, The picture shows the prototype of the European railway
P2P_Dijkstra
- Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法的Dial实现是通过一系列方法，对Dijkstra算法进行加速。-Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm to compute a node to all other nodes of the s
Floyd
- 单源最短路 Floyd 详细解读：有C的简单核心代码，有例子-Single-Source Shortest detailed interpretation of Floyd: There is a simple C core code, there are examples
k-way
- K最短路问题。大家现在已经知道了如何求单源点最短路径问题，但在实际应用中，有时候需要除了需要知道最短路径外，尚需求解次最短路或第三最短路，即要知道多条最短路，并排出其长度增加的顺序。如在通信网络中，有时候某条线路中断，则需要找一个替代的方案，这就需要找到几条最短路以备不时之需。这样一类多条最短路问题即称为K最短路问题。-K shortest path problem. We now know how to find single source shortest path problem, but
fenzhijiexianfa
- 分支界限法是由“分支”和“界限”策略两个部分组成，其中“分支”策略是对问题空间按照广度优先的策略进行搜索；“限界”策略是为了加速搜索速度而采用启发信息剪枝的策略。 使用分支限界法来解决单源最短路径问题时主要利用结点控制关系剪枝，在一般情况下，如果解空间树中以结点Y为根的子树中所含的解优于以结点X为根的子树中所含的解，则结点Y控制了结点X，以被控制的结点X为根的子树可以剪去。算法实现时，使用邻接矩阵表示图，二维数组存储图的邻接矩阵，使用数组记录源到各顶点的距离和路径上的前驱顶点。 -Br
zuiduanlujing
- 单源节点最短路径的C++源程序代码下载。-Single-source shortest path node C++ source code download.
shortpath
- 有向图单源最短路径，由随机函数产生边权，源顶点可以自己指定。-A single-source shortest path to the graph, the right side by a random function generator, source vertex can specify your own.