forked from johannesgerer/jburkardt-cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
toms097.html
163 lines (135 loc) · 3.75 KB
/
toms097.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
<html>
<head>
<title>
TOMS097 - All Pairs Shortest Distance, Floyd's Algorithm.
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
TOMS097 <br> All Pairs Shortest Distance, Floyd's Algorithm.
</h1>
<hr>
<p>
<b>TOMS097</b>
is a C++ library which
computes the distance between all pairs of nodes in a directed graph
with weighted edges, using Floyd's algorithm.
</p>
<h3 align = "center">
Licensing:
</h3>
<p>
The computer code and data files 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>TOMS097</b> is available in
<a href = "../../c_src/toms097/toms097.html">a C version</a> and
<a href = "../../cpp_src/toms097/toms097.html">a C++ version</a> and
<a href = "../../f77_src/toms097/toms097.html">a FORTRAN77 version</a> and
<a href = "../../f_src/toms097/toms097.html">a FORTRAN90 version</a> and
<a href = "../../m_src/toms097/toms097.html">a MATLAB version</a>.
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../datasets/cities/cities.html">
CITIES</a>,
a dataset directory which
contains a number of city distance datasets.
</p>
<p>
<a href = "../../cpp_src/dijkstra/dijkstra.html">
DIJKSTRA</a>,
a C++ program which
runs a simple example of Dijkstra's minimum distance algorithm for graphs.
</p>
<p>
<a href = "../../cpp_src/floyd/floyd.html">
FLOYD</a>,
a C++ library which
implements Floyd's algorithm for finding the shortest distance
between every pair of nodes in a directed graph.
</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>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "toms097.cpp">toms097.cpp</a>, the source code.
</li>
<li>
<a href = "toms097.hpp">toms097.hpp</a>, the include file.
</li>
<li>
<a href = "toms097.sh">toms097.sh</a>,
BASH commands to compile the source code.
</li>
</ul>
</p>
<h3 align = "center">
Examples and Tests:
</h3>
<p>
<ul>
<li>
<a href = "toms097_prb.cpp">toms097_prb.cpp</a>,
a sample calling program.
</li>
<li>
<a href = "toms097_prb.sh">toms097_prb.sh</a>,
BASH commands to compile and run the sample program.
</li>
<li>
<a href = "toms097_prb_output.txt">toms097_prb_output.txt</a>,
the output file.
</li>
</ul>
</p>
<h3 align = "center">
List of Routines:
</h3>
<p>
<ul>
<li>
<b>I4MAT_SHORTEST_PATH</b> computes the shortest distance between all pairs of points.
</li>
<li>
<b>R8MAT_SHORTEST_PATH</b> computes the shortest distance between all pairs of points.
</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 = "../cpp_src.html">
the C++ source codes</a>.
</p>
<hr>
<i>
Last revised on 01 March 2014.
</i>
<!-- John Burkardt -->
</body>
<!-- Initial HTML skeleton created by HTMLINDEX. -->
</html>