-
Notifications
You must be signed in to change notification settings - Fork 57
/
bellman_ford.html
160 lines (135 loc) · 4.04 KB
/
bellman_ford.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
<html>
<head>
<title>
BELLMAN_FORD - All-to-One Shortest Distances on Directed Graph
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
BELLMAN_FORD <br> All-to-One Shortest Distances on Directed Graph
</h1>
<hr>
<p>
<b>BELLMAN_FORD</b>,
a MATLAB library which
implements the Bellman-Ford algorithm for finding the shortest distance
from a given node to all other nodes in a directed graph whose
edges have been assigned real-valued lengths.
</p>
<h3 align = "center">
Licensing:
</h3>
<p>
The computer code and data files described and made available on this
web page are distributed under
<a href = "../../txt/gnu_lgpl.txt">the GNU LGPL license.</a>
</p>
<h3 align = "center">
Languages:
</h3>
<p>
<b>BELLMAN_FORD</b> is available in
<a href = "../../c_src/bellman_ford/bellman_ford.html">a C version</a> and
<a href = "../../cpp_src/bellman_ford/bellman_ford.html">a C++ version</a> and
<a href = "../../f77_src/bellman_ford/bellman_ford.html">a FORTRAN77 version</a> and
<a href = "../../f_src/bellman_ford/bellman_ford.html">a FORTRAN90 version</a> and
<a href = "../../m_src/bellman_ford/bellman_ford.html">a MATLAB version</a> and
<a href = "../../py_src/bellman_ford/bellman_ford.html">a Python version</a>.
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../m_src/dijkstra/dijkstra.html">
DIJKSTRA</a>,
a MATLAB library which
implements a simple version of Dijkstra's minimum distance algorithm
for graphs.
</p>
<p>
<a href = "../../m_src/floyd/floyd.html">
FLOYD</a>,
a MATLAB library which
implements Floyd's algorithm for finding the shortest distance
between pairs of nodes on a directed graph.
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ol>
<li>
Richard Bellman,<br>
On a routing problem,<br>
Quarterly of Applied Mathematics,<br>
Volume 16, 1958, pages 87-90.
</li>
<li>
Lester Ford,<br>
Network Flow Theory,<br>
RAND Corporation Paper P-923, 1956.
</li>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "bellman_ford.m">bellman_ford.m</a>,
finds shortest paths from a given vertex of a weighted directed graph.
</li>
<li>
<a href = "i4mat_transpose_print.m">i4mat_transpose_print.m</a>,
prints an I4MAT, transposed.
</li>
<li>
<a href = "i4mat_transpose_print_some.m">i4mat_transpose_print_some.m</a>,
prints some of an I4MAT, transposed.
</li>
<li>
<a href = "i4vec_print.m">i4vec_print.m</a>,
prints an I4VEC.
</li>
<li>
<a href = "r8vec_print.m">r8vec_print.m</a>,
prints an R8VEC.
</li>
<li>
<a href = "timestamp.m">timestamp.m</a>,
prints the current YMDHMS date as a time stamp.
</li>
</ul>
</p>
<h3 align = "center">
Examples and Tests:
</h3>
<p>
<ul>
<li>
<a href = "bellman_ford_test.m">bellman_ford_test.m</a>,
a sample calling program.
</li>
<li>
<a href = "bellman_ford_test01.m">bellman_ford_test01.m</a>,
solves a small problem with 6 nodes and 10 edges.
</li>
<li>
<a href = "bellman_ford_test_output.txt">bellman_ford_test_output.txt</a>,
the output file.
</li>
</ul>
</p>
<p>
You can go up one level to <a href = "../m_src.html">
the MATLAB source codes</a>.
</p>
<hr>
<i>
Last revised on 13 November 2014.
</i>
<!-- John Burkardt -->
</body>
<!-- Initial HTML skeleton created by HTMLINDEX. -->
</html>