-
Notifications
You must be signed in to change notification settings - Fork 59
/
floyd.html
241 lines (205 loc) · 5.78 KB
/
floyd.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
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
<html>
<head>
<title>
FLOYD - Shortest Distances Between Nodes in a Directed Graph
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
FLOYD <br> Shortest Distances Between Nodes in a Directed Graph
</h1>
<hr>
<p>
<b>FLOYD</b>
is a FORTRAN90 library which
demonstrates Floyd's algorithm for finding the shortest distance
between every pair of nodes in a directed graph.
</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>FLOYD</b> is available in
<a href = "../../c_src/floyd/floyd.html">a C version</a> and
<a href = "../../cpp_src/floyd/floyd.html">a C++ version</a> and
<a href = "../../f_src/floyd/floyd.html">a FORTRAN90 version</a> and
<a href = "../../f77_src/floyd/floyd.html">a FORTRAN77 version</a> and
<a href = "../../m_src/floyd/floyd.html">a MATLAB version</a>.
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../f_src/cities/cities.html">
CITIES</a>,
a FORTRAN90 library which
handles various problems associated with a set of "cities" on a map.
</p>
<p>
<a href = "../../datasets/cities/cities.html">
CITIES</a>,
a dataset directory which
contains a number of city distance datasets.
</p>
<p>
<a href = "../../f_src/codepack/codepack.html">
CODEPACK</a>,
a FORTRAN90 library which
computes "codes" that can determine if two graphs are isomorphic.
<p>
<p>
<a href = "../../f_src/dijkstra/dijkstra.html">
DIJKSTRA</a>,
a FORTRAN90 program which
runs a simple example of Dijkstra's minimum distance algorithm for graphs.
</p>
<p>
<a href = "../../f_src/grafpack/grafpack.html">
GRAFPACK</a>,
a FORTRAN90 library which
computes various quantities associated with mathematical graphs.
<p>
<p>
<a href = "../../data/graph_representation/graph_representation.html">
GRAPH_REPRESENTATION</a>,
a data directory of examples of ways of representing abstract
mathematical graphs
</p>
<p>
<a href = "../../data/grf/grf.html">
GRF</a>,
a data directory which
contains a description of the GRF format and some examples.
</p>
<p>
<a href = "../../f_src/grf_io/grf_io.html">
GRF_IO</a>,
a FORTRAN90 library which
reads and writes GRF files.
</p>
<p>
<a href = "../../f_src/grf_to_eps/grf_to_eps.html">
GRF_TO_EPS</a>,
a FORTRAN90 library which
can make an encapsulated PostScript image of a
GRF file.
</p>
<p>
<a href = "../../f_src/subset/subset.html">
SUBSET</a>,
a FORTRAN90 library which
generates, ranks and unranks various combinatorial objects.
</p>
<p>
<a href = "../../f_src/table_graph_code/table_graph_code.html">
TABLE_GRAPH_CODE</a>,
a FORTRAN90 program which
reads a TABLE file describing a graph, and computes its graph code.
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ol>
<li>
Robert Floyd,<br>
Algorithm 97: Shortest Path,<br>
Communications of the ACM,<br>
Volume 5, Number 6, page 345, June 1962.
</li>
<li>
Michael Quinn,<br>
Parallel Programming in C with MPI and OpenMP,<br>
McGraw-Hill, 2004,<br>
ISBN13: 978-0071232654,<br>
LC: QA76.73.C15.Q55.
</li>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "floyd.f90">floyd.f90</a>, the source code.
</li>
<li>
<a href = "floyd.sh">floyd.sh</a>,
commands to compile the source code.
</li>
</ul>
</p>
<h3 align = "center">
Examples and Tests:
</h3>
<p>
<ul>
<li>
<a href = "floyd_prb.f90">floyd_prb.f90</a>,
a sample calling program.
</li>
<li>
<a href = "floyd_prb.sh">floyd_prb.sh</a>,
commands to compile and run the sample program.
</li>
<li>
<a href = "floyd_prb_output.txt">floyd_prb_output.txt</a>,
the output file.
</li>
</ul>
</p>
<h3 align = "center">
List of Routines:
</h3>
<p>
<ul>
<li>
<b>I4_HUGE</b> returns a "huge" I4.
</li>
<li>
<b>I4MAT_FLOYD</b> finds the shortest I4 distances between pairs of nodes in a directed graph.
</li>
<li>
<b>I4MAT_PRINT</b> prints an I4MAT.
</li>
<li>
<b>I4MAT_PRINT_SOME</b> prints some of an I4MAT.
</li>
<li>
<b>R8_HUGE</b> returns a very large R8.
</li>
<li>
<b>R8MAT_FLOYD</b> finds the shortest R8 distances between pairs of nodes in a directed graph.
</li>
<li>
<b>R8MAT_PRINT</b> prints an R8MAT.
</li>
<li>
<b>R8MAT_PRINT_SOME</b> prints some of an R8MAT.
</li>
<li>
<b>TIMESTAMP</b> prints the current YMDHMS date as a time stamp.
</li>
</ul>
</p>
<p>
You can go up one level to <a href = "../f_src.html">
the FORTRAN90 source codes</a>.
</p>
<hr>
<i>
Last revised on 26 November 2008.
</i>
<!-- John Burkardt -->
</body>
<!-- Initial HTML skeleton created by HTMLINDEX. -->
</html>