Location:
Search - ford
Search list
Description: Bellman-Ford Shortest Path Algorithm
(C) 2004 by Yu Hen Hu
find shortest path from a fixed point U to any node V
clear all
n=input( Total number of nodes = )
echo on
starting from a fixed point U, you enter the weight to each
node as the weight on the edge from U to that node V
if there is no such edge, enter inf
when enter a vector, put all number within brackets [ ]
echo o-Bellman-Ford Shortest Path Algorithm
(C) 2004 by Yu Hen Hu
find shortest path from a fixed point U to any node V
clear all
n=input( Total number of nodes = )
echo on
starting from a fixed point U, you enter the weight to each
node as the weight on the edge from U to that node V
if there is no such edge, enter inf
when enter a vector, put all number within brackets [ ]
echo off
Platform: |
Size: 1024 |
Author: vahid |
Hits:
Description: this a very nice cv to the ford company from a very nice student.-this is a very nice cv to the ford company from a very nice student.
Platform: |
Size: 7168 |
Author: nitin singh |
Hits:
Description: bellman-ford的实现。可以输出每条最短路径经过的节点-bellman-ford implementation. After the shortest path to the output node of each
Platform: |
Size: 1045504 |
Author: xuwanting |
Hits:
Description: 传递闭包在算法中是一种很重要的工具，可以帮助我们ACMer判断两者之间是否有联系-Bellman-Ford it s very important in programming.
Platform: |
Size: 8192 |
Author: 江七 |
Hits:
Description: Bellman-ford算法，根据顶点和边的权值求出最短路径-Bellman-ford algorithm, based on the weights of vertices and edges of the shortest path obtained
Platform: |
Size: 187392 |
Author: james |
Hits:
Description: algorthm ford-fulkrson in java code source
Platform: |
Size: 15360 |
Author: ali |
Hits:
Description: Bellman Ford algorithm for finding negative weight of the graph.
Platform: |
Size: 1024 |
Author: anis |
Hits:
Description: Destination-Sequenced Distance Vector is a table-driven routing scheme for ad hoc mobile networks based on the Bellman-Ford algorithm, Use of network simulation tool NS2, TCL coding.
Platform: |
Size: 3072 |
Author: Mahendran |
Hits:
Description: Bellman-Ford Routing Algorithm
Platform: |
Size: 105472 |
Author: tooha |
Hits:
Description: Ford最短路算法实现，改进型算法，可以求带负权值的图-Ford shortest path algorithm
Platform: |
Size: 1024 |
Author: 樊双喜 |
Hits:
Description: this is about bellman ford algorithm
Platform: |
Size: 91136 |
Author: kirthika |
Hits:
Description: 在实际问题中，边的权值一般以正权的形式出现，但是很多情况下负权也是存在的。这个时候，最短路径不一定存在。我们无法得到像dijkstra算法那样时间复杂度较低的算法，但是，仍然可以用bellman-ford迭代算法去解决问题。
bellman-ford算法是迭代算法，它不像dijkstra算法，按照一定的顺序直接算出每个点的距离值，而是不断地修改每个点的当前最小距离值，直到求出真正的最短距离为止。
-In practical problems, the edge weight is generally in the form of being the right, but many cases the negative right to exist. This time, the shortest path may not exist. We can not get the algorithm dijkstra algorithm time complexity is low, but you can still use the bellman-ford iterative algorithm to solve the problem.
The bellman-ford algorithm is an iterative algorithm, it is not the dijkstra algorithm to directly calculate the distance value of each point in a certain order, but modify each point of the current minimum distance value, until you find the real shortest distance so far .
Platform: |
Size: 14336 |
Author: liuyunyang |
Hits:
Description: 链路状态法，即bellman-ford算法-Link state law, that the bellman-ford algorithm
Platform: |
Size: 972800 |
Author: 康健 |
Hits:
Description: Belmen Ford Source Code
Platform: |
Size: 1024 |
Author: sultan |
Hits:
Description: 最短路径算法—Bellman-Ford(贝尔曼 福特 贝尔曼-福特 最短路径算法 贝尔曼 福特) 算法分析与实现-bellman-ford algorithm to calculate the shortest walk from a source node
Platform: |
Size: 1024 |
Author: 赵希萌 |
Hits:
Description: Ford Fiesta Service mamual
Platform: |
Size: 5372928 |
Author: ivan |
Hits:
Description: Ford Fulkerson for shortest path recognition implementation in C language
Platform: |
Size: 1024 |
Author: Rahul |
Hits:
Description: 算法导论对最大流算法有很详细的介绍，今天实现了最大流Ford-Fulkerson的算法，包括BFS和DFS来搜索增广路径。
-Introduction to Algorithms maximum flow algorithm has a very detailed briefing today to achieve the maximum flow algorithm of Ford-Fulkerson, including BFS and DFS search augmenting path.
Platform: |
Size: 1024 |
Author: jady |
Hits:
Description: 单源最短路径Bellman-ford。该算法可以用来解决一般（边的权值为负）的单源最短路径问题，而dijkstra只能解决权值非负的情况。此算法使用松弛技术，对每一个顶点，逐步减少源到该顶点的路径的估计值，直到达到最短的路径。-Single source shortest path Bellman-ford. The algorithm can be used to solve the general (the right side is negative) single-source shortest path problem, and dijkstra can only solve the case of non-negative weights. This algorithm uses relaxation techniques, for each vertex, to gradually reduce the source to the vertex of the estimated value until the shortest path.
Platform: |
Size: 33792 |
Author: 小马 |
Hits:
Description: C语言编写的，用标号算法解决最大流问题，文件中有例子和结果，适合初学者学习使用。-Written in C language, with Ford-Fulkerson algorithm to solve the problem, a file with examples and results, suitable for beginners learning to use.
Platform: |
Size: 19456 |
Author: 谱算法 |
Hits: