-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathhedetniemi_8h_source.html
287 lines (285 loc) · 38.9 KB
/
hedetniemi_8h_source.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
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>NetSci: hedetniemi.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@2/MathJax.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">NetSci
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "search/",'.html');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
$(document).ready(function() { init_codefold(0); });
/* @license-end */
</script>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_a4dea0305c25785a125049bc4f0e1ec7.html">netcalc</a></li><li class="navelem"><a class="el" href="dir_3e3a4bfd5d345b3740f0287a55de24bf.html">include</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle"><div class="title">hedetniemi.h</div></div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">//</span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment">// Created by astokely on 5/10/23.</span></div>
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment">//</span></div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span> </div>
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="preprocessor">#ifndef NETCALC_HEDETNIEMI_H</span></div>
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="preprocessor">#define NETCALC_HEDETNIEMI_H</span></div>
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span> </div>
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="preprocessor">#include <vector></span></div>
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="preprocessor">#include "cuarray.h"</span></div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="preprocessor">#include "platform.h"</span></div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span> </div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacenetcalc.html">netcalc</a> {<span class="comment"></span></div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span><span class="comment"> /*!</span></div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="comment"> * \brief Compute the shortest paths and shortest path lengths between all pairs of nodes in a graph.</span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="comment"> *</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="comment"> * \param A Adjacency matrix of the graph.</span></div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="comment"> * \param H NxN matrix of shortest path lengths, where N is the number of nodes in the graph.</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="comment"> * Each matrix element represents the shortest path length between the nodes corresponding</span></div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="comment"> * to the row and column indices of the element.</span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="comment"> * \param paths Nx(N*k) matrix of shortest paths, where N is the number of nodes in the graph and k is</span></div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="comment"> * the number of nodes in the longest shortest path. Each row of the matrix contains the shortest</span></div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="comment"> * path between the node corresponding to the row index and all other nodes. Each path has k elements,</span></div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="comment"> * where the first element is the node corresponding to the row index and the last element is the node</span></div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="comment"> * corresponding to the column. Unless the path is the longest shortest path, the remaining elements are -1.</span></div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="comment"> * \param maxPathLength The maximum number of nodes in a shortest</span></div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="comment"> * allowed in a shortest path. The maximum</span></div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="comment"> * number of edges allowed in a shortest path</span></div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="comment"> * is equal to maxPathLength - 1.</span></div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="comment"> * \param platform Platform used to perform the calculation. Use 0 for GPU and 1 for CPU.</span></div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="comment"> */</span></div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"><a class="line" href="namespacenetcalc.html#abcb4e6f17cf9607067cdb26e2757e141"> 31</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="namespacenetcalc.html#abcb4e6f17cf9607067cdb26e2757e141">hedetniemiAllShortestPaths</a>(</div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> <a class="code hl_class" href="classCuArray.html">CuArray<float></a>* A,</div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> <a class="code hl_class" href="classCuArray.html">CuArray<float></a>* H,</div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> <a class="code hl_class" href="classCuArray.html">CuArray<int></a>* paths,</div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> <span class="keywordtype">int</span> maxPathLength,</div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> <span class="keywordtype">int</span> platform</div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> );</div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="comment"></span> </div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span><span class="comment"> /*!</span></div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span><span class="comment"> * \brief Compute the shortest paths and shortest path lengths between all pairs of nodes in a graph on the GPU.</span></div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span><span class="comment"> *</span></div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="comment"> * \param A Adjacency matrix of the graph.</span></div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span><span class="comment"> *</span></div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span><span class="comment"> * \param H NxN matrix of shortest path lengths, where N is the number of nodes in the graph.</span></div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span><span class="comment"> * Each matrix element represents the shortest path length between the nodes corresponding</span></div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span><span class="comment"> * to the row and column indices of the element.</span></div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span><span class="comment"> *</span></div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span><span class="comment"> * \param paths Nx(N*k) matrix of shortest paths, where N is the number of nodes in the graph and k is</span></div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span><span class="comment"> * the number of nodes in the longest shortest path. Each row of the matrix contains the shortest</span></div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span><span class="comment"> * path between the node corresponding to the row index and all other nodes. Each path has k elements,</span></div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span><span class="comment"> * where the first element is the node corresponding to the row index and the last element is the node</span></div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span><span class="comment"> * corresponding to the column. Unless the path is the longest shortest path, the remaining elements are -1.</span></div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span><span class="comment"> *</span></div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span><span class="comment"> * \param maxPathLength The maximum number of nodes in a shortest</span></div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span><span class="comment"> * allowed in a shortest path. The maximum</span></div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span><span class="comment"> * number of edges allowed in a shortest path</span></div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span><span class="comment"> * is equal to maxPathLength - 1.</span></div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span><span class="comment"> */</span></div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="namespacenetcalc.html#ac0bf5005b74c6d53436daf970e3d69d5"> 59</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="namespacenetcalc.html#ac0bf5005b74c6d53436daf970e3d69d5">hedetniemiAllShortestPathsGpu</a>(</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <a class="code hl_class" href="classCuArray.html">CuArray<float></a>* A,</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <a class="code hl_class" href="classCuArray.html">CuArray<float></a>* H,</div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <a class="code hl_class" href="classCuArray.html">CuArray<int></a>* paths,</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordtype">int</span> maxPathLength</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> );</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span><span class="comment"></span> </div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span><span class="comment"> /*!</span></div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span><span class="comment"> * \brief Compute the shortest paths and shortest path lengths</span></div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span><span class="comment"> * between all pairs of nodes in a graph on the CPU.</span></div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span><span class="comment"> *</span></div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span><span class="comment"> * \param A Adjacency matrix of the graph.</span></div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span><span class="comment"> *</span></div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span><span class="comment"> * \param H NxN matrix of shortest path lengths, where N is the number of nodes in the graph.</span></div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span><span class="comment"> * Each matrix element represents the shortest path length between the nodes corresponding</span></div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span><span class="comment"> * to the row and column indices of the element.</span></div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span><span class="comment"> *</span></div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span><span class="comment"> * \param paths Nx(N*k) matrix of shortest paths, where N is the number of nodes in the graph and k is</span></div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span><span class="comment"> * the number of nodes in the longest shortest path. Each row of the matrix contains the shortest</span></div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span><span class="comment"> * path between the node corresponding to the row index and all other nodes. Each path has k elements,</span></div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span><span class="comment"> * where the first element is the node corresponding to the row index and the last element is the node</span></div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span><span class="comment"> * corresponding to the column. Unless the path is the longest shortest path, the remaining elements are -1.</span></div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span><span class="comment"> *</span></div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span><span class="comment"> * \param maxPathLength The maximum number of nodes in a shortest</span></div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span><span class="comment"> * allowed in a shortest path. The maximum</span></div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span><span class="comment"> * number of edges allowed in a shortest path</span></div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span><span class="comment"> * is equal to maxPathLength - 1.</span></div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span><span class="comment"> */</span></div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"><a class="line" href="namespacenetcalc.html#ad6e438f4a43e4d8a32e915668b0af7f1"> 87</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="namespacenetcalc.html#ad6e438f4a43e4d8a32e915668b0af7f1">hedetniemiAllShortestPathsCpu</a>(</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <a class="code hl_class" href="classCuArray.html">CuArray<float></a>* A,</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <a class="code hl_class" href="classCuArray.html">CuArray<float></a>* H,</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <a class="code hl_class" href="classCuArray.html">CuArray<int></a>* paths,</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keywordtype">int</span> maxPathLength</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> );</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span><span class="comment"></span> </div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span><span class="comment"> /*!</span></div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span><span class="comment"> * \brief Compute the shortest path lengths between all pairs of nodes in a graph.</span></div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span><span class="comment"> *</span></div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span><span class="comment"> * \param A Adjacency matrix of the graph.</span></div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span><span class="comment"> *</span></div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span><span class="comment"> * \param H NxN matrix of shortest path lengths, where N is the number of nodes in the graph.</span></div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span><span class="comment"> * Each matrix element represents the shortest path length between the nodes corresponding</span></div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span><span class="comment"> * to the row and column indices of the element.</span></div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span><span class="comment"> */</span></div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"><a class="line" href="namespacenetcalc.html#a273fb657d5389705f1d40dd1071f238d"> 103</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="namespacenetcalc.html#a273fb657d5389705f1d40dd1071f238d">hedetniemiAllShortestPathLengths</a>(</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <a class="code hl_class" href="classCuArray.html">CuArray<float></a> *A,</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <a class="code hl_class" href="classCuArray.html">CuArray<float></a> *H,</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="keywordtype">int</span> maxPathLength,</div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="keywordtype">int</span> platform</div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> );</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span><span class="comment"></span> </div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span><span class="comment"> /*!</span></div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span><span class="comment"> * \brief Compute the shortest path lengths between all pairs of nodes in a graph on the GPU.</span></div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span><span class="comment"> *</span></div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span><span class="comment"> * \param A Adjacency matrix of the graph.</span></div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span><span class="comment"> *</span></div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span><span class="comment"> * \param H NxN matrix of shortest path lengths, where N is the number of nodes in the graph.</span></div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span><span class="comment"> * Each matrix element represents the shortest path length between the nodes corresponding</span></div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span><span class="comment"> * to the row and column indices of the element.</span></div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span><span class="comment"> */</span></div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"><a class="line" href="namespacenetcalc.html#a03915194208f5f2eacbdbbd59ca53099"> 119</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="namespacenetcalc.html#a03915194208f5f2eacbdbbd59ca53099">hedetniemiAllShortestPathLengthsGpu</a>(</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <a class="code hl_class" href="classCuArray.html">CuArray<float></a> *A,</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <a class="code hl_class" href="classCuArray.html">CuArray<float></a> *H,</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="keywordtype">int</span> maxPathLength</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> );</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span><span class="comment"></span> </div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span><span class="comment"> /*!</span></div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span><span class="comment"> * \brief Converts a correlation matrix from a generalized correlation calculation to an adjacency matrix.</span></div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span><span class="comment"> * Each element represents the edge weight between two nodes, where the weight is equal to 1/rij, where rij</span></div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span><span class="comment"> * is the correlation between node i and node j if rij > 0. If rij <= 0, the edge weight is set to infinity.</span></div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span><span class="comment"> * All diagonal elements are set to 0.</span></div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span><span class="comment"> *</span></div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span><span class="comment"> * \param A The adjacency matrix.</span></div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span><span class="comment"> * \param C The correlation matrix.</span></div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span><span class="comment"> * \param n The number of nodes in the graph.</span></div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span><span class="comment"> * \param platform Platform used to perform the calculation. Use 0 for GPU and 1 for CPU.</span></div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span><span class="comment"> */</span></div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"><a class="line" href="namespacenetcalc.html#ab56d21e75639a17e01c6a449f67a5a5f"> 136</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="namespacenetcalc.html#ab56d21e75639a17e01c6a449f67a5a5f">correlationToAdjacency</a>(</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <a class="code hl_class" href="classCuArray.html">CuArray<float></a>* A,</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <a class="code hl_class" href="classCuArray.html">CuArray<float></a>* C,</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="keywordtype">int</span> n,</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="keywordtype">int</span> platform</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> );</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span><span class="comment"></span> </div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span><span class="comment"> /*!</span></div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span><span class="comment"> * \brief Converts a correlation matrix from a generalized correlation calculation to an adjacency matrix on the GPU.</span></div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span><span class="comment"> * Each element represents the edge weight between two nodes, where the weight is equal to 1/rij, where rij</span></div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span><span class="comment"> * is the correlation between node i and node j if rij > 0. If rij <= 0, the edge weight is set to infinity.</span></div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span><span class="comment"> * All diagonal elements are set to 0.</span></div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span><span class="comment"> *</span></div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span><span class="comment"> * \param A The adjacency matrix.</span></div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span><span class="comment"> * \param C The correlation matrix.</span></div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span><span class="comment"> * \param n The number of nodes in the graph.</span></div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span><span class="comment"> */</span></div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"><a class="line" href="namespacenetcalc.html#ad82438a2b54ee9f994cb06fd70454917"> 153</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="namespacenetcalc.html#ad82438a2b54ee9f994cb06fd70454917">correlationToAdjacencyGpu</a>(</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <a class="code hl_class" href="classCuArray.html">CuArray<float></a>* A,</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <a class="code hl_class" href="classCuArray.html">CuArray<float></a>* C,</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <span class="keywordtype">int</span> n</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> );</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span><span class="comment"></span> </div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span><span class="comment"> /*!</span></div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span><span class="comment"> * \brief Returns the shortest path between node i and node j.</span></div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span><span class="comment"> *</span></div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span><span class="comment"> * \param paths Nx(N*k) matrix of shortest paths, where N is the number of nodes in the graph and k is</span></div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span><span class="comment"> * the number of nodes in the longest shortest path.</span></div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span><span class="comment"> * \param maxPathLength The maximum number of nodes in a shortest</span></div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span><span class="comment"> * path, which is equal to the maximum number</span></div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span><span class="comment"> * of edges allowed plus 1.</span></div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span><span class="comment"> * \param i The index of the first node in the path.</span></div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span><span class="comment"> * \param j The index of the last node in the path.</span></div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span><span class="comment"> */</span></div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"><a class="line" href="namespacenetcalc.html#a8314879a5613dbc1f3e9caae53329964"> 170</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="namespacenetcalc.html#a8314879a5613dbc1f3e9caae53329964">recoverSingleShortestPath</a>(</div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="keywordtype">int</span>** NUMPY_ARRAY,</div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="keywordtype">int</span>** NUMPY_ARRAY_DIM1,</div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <a class="code hl_class" href="classCuArray.html">CuArray<int></a>* paths,</div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="keywordtype">int</span> maxPathLength,</div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="keywordtype">int</span> i,</div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="keywordtype">int</span> j</div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> );</div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span>}</div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> </div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span><span class="preprocessor">#endif </span><span class="comment">// NETCALC_HEDETNIEMI_H</span></div>
<div class="ttc" id="aclassCuArray_html"><div class="ttname"><a href="classCuArray.html">CuArray</a></div><div class="ttdoc">Manages CUDA-supported arrays, offering initialization, memory management, and data manipulation....</div><div class="ttdef"><b>Definition</b> cuarray.h:24</div></div>
<div class="ttc" id="anamespacenetcalc_html"><div class="ttname"><a href="namespacenetcalc.html">netcalc</a></div><div class="ttdoc">The netcalc namespace.</div></div>
<div class="ttc" id="anamespacenetcalc_html_a03915194208f5f2eacbdbbd59ca53099"><div class="ttname"><a href="namespacenetcalc.html#a03915194208f5f2eacbdbbd59ca53099">netcalc::hedetniemiAllShortestPathLengthsGpu</a></div><div class="ttdeci">void hedetniemiAllShortestPathLengthsGpu(CuArray< float > *A, CuArray< float > *H, int maxPathLength)</div><div class="ttdoc">Compute the shortest path lengths between all pairs of nodes in a graph on the GPU.</div></div>
<div class="ttc" id="anamespacenetcalc_html_a273fb657d5389705f1d40dd1071f238d"><div class="ttname"><a href="namespacenetcalc.html#a273fb657d5389705f1d40dd1071f238d">netcalc::hedetniemiAllShortestPathLengths</a></div><div class="ttdeci">void hedetniemiAllShortestPathLengths(CuArray< float > *A, CuArray< float > *H, int maxPathLength, int platform)</div><div class="ttdoc">Compute the shortest path lengths between all pairs of nodes in a graph.</div></div>
<div class="ttc" id="anamespacenetcalc_html_a8314879a5613dbc1f3e9caae53329964"><div class="ttname"><a href="namespacenetcalc.html#a8314879a5613dbc1f3e9caae53329964">netcalc::recoverSingleShortestPath</a></div><div class="ttdeci">void recoverSingleShortestPath(int **NUMPY_ARRAY, int **NUMPY_ARRAY_DIM1, CuArray< int > *paths, int maxPathLength, int i, int j)</div><div class="ttdoc">Returns the shortest path between node i and node j.</div></div>
<div class="ttc" id="anamespacenetcalc_html_ab56d21e75639a17e01c6a449f67a5a5f"><div class="ttname"><a href="namespacenetcalc.html#ab56d21e75639a17e01c6a449f67a5a5f">netcalc::correlationToAdjacency</a></div><div class="ttdeci">void correlationToAdjacency(CuArray< float > *A, CuArray< float > *C, int n, int platform)</div><div class="ttdoc">Converts a correlation matrix from a generalized correlation calculation to an adjacency matrix....</div></div>
<div class="ttc" id="anamespacenetcalc_html_abcb4e6f17cf9607067cdb26e2757e141"><div class="ttname"><a href="namespacenetcalc.html#abcb4e6f17cf9607067cdb26e2757e141">netcalc::hedetniemiAllShortestPaths</a></div><div class="ttdeci">void hedetniemiAllShortestPaths(CuArray< float > *A, CuArray< float > *H, CuArray< int > *paths, int maxPathLength, int platform)</div><div class="ttdoc">Compute the shortest paths and shortest path lengths between all pairs of nodes in a graph.</div></div>
<div class="ttc" id="anamespacenetcalc_html_ac0bf5005b74c6d53436daf970e3d69d5"><div class="ttname"><a href="namespacenetcalc.html#ac0bf5005b74c6d53436daf970e3d69d5">netcalc::hedetniemiAllShortestPathsGpu</a></div><div class="ttdeci">void hedetniemiAllShortestPathsGpu(CuArray< float > *A, CuArray< float > *H, CuArray< int > *paths, int maxPathLength)</div><div class="ttdoc">Compute the shortest paths and shortest path lengths between all pairs of nodes in a graph on the GPU...</div></div>
<div class="ttc" id="anamespacenetcalc_html_ad6e438f4a43e4d8a32e915668b0af7f1"><div class="ttname"><a href="namespacenetcalc.html#ad6e438f4a43e4d8a32e915668b0af7f1">netcalc::hedetniemiAllShortestPathsCpu</a></div><div class="ttdeci">void hedetniemiAllShortestPathsCpu(CuArray< float > *A, CuArray< float > *H, CuArray< int > *paths, int maxPathLength)</div><div class="ttdoc">Compute the shortest paths and shortest path lengths between all pairs of nodes in a graph on the CPU...</div></div>
<div class="ttc" id="anamespacenetcalc_html_ad82438a2b54ee9f994cb06fd70454917"><div class="ttname"><a href="namespacenetcalc.html#ad82438a2b54ee9f994cb06fd70454917">netcalc::correlationToAdjacencyGpu</a></div><div class="ttdeci">void correlationToAdjacencyGpu(CuArray< float > *A, CuArray< float > *C, int n)</div><div class="ttdoc">Converts a correlation matrix from a generalized correlation calculation to an adjacency matrix on th...</div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8
</small></address>
</body>
</html>