-
Notifications
You must be signed in to change notification settings - Fork 2
/
_i_ordering_algorithm_8h_source.html
204 lines (202 loc) · 25.1 KB
/
_i_ordering_algorithm_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
<!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">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.9.1"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>ug4: ugbase/lib_algebra/ordering_strategies/algorithms/IOrderingAlgorithm.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="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.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="http://cdn.mathjax.org/mathjax/latest/MathJax.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="extra_stylesheet.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 style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">ug4
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.1 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('_i_ordering_algorithm_8h_source.html',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- 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">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle">
<div class="title">IOrderingAlgorithm.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="_i_ordering_algorithm_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"> * Copyright (c) 2020: G-CSC, Goethe University Frankfurt</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * Author: Lukas Larisch</span></div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> * </span></div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> * This file is part of UG4.</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * </span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> * UG4 is free software: you can redistribute it and/or modify it under the</span></div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"> * terms of the GNU Lesser General Public License version 3 (as published by the</span></div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment"> * Free Software Foundation) with the following additional attribution</span></div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment"> * requirements (according to LGPL/GPL v3 §7):</span></div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment"> * </span></div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment"> * (1) The following notice must be displayed in the Appropriate Legal Notices</span></div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"> * of covered and combined works: "Based on UG4 (www.ug4.org/license)".</span></div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> * </span></div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"> * (2) The following notice must be displayed at a prominent place in the</span></div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment"> * terminal output of covered works: "Based on UG4 (www.ug4.org/license)".</span></div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment"> * </span></div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment"> * (3) The following bibliography is recommended for citation and must be</span></div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"> * preserved in all covered files:</span></div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"> * "Reiter, S., Vogel, A., Heppner, I., Rupp, M., and Wittum, G. A massively</span></div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment"> * parallel geometric multigrid solver on hierarchically distributed grids.</span></div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment"> * Computing and visualization in science 16, 4 (2013), 151-164"</span></div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment"> * "Vogel, A., Reiter, S., Rupp, M., Nägel, A., and Wittum, G. UG4 -- a novel</span></div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"> * flexible software system for simulating pde based models on high performance</span></div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment"> * computers. Computing and visualization in science 16, 4 (2013), 165-179"</span></div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * </span></div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * This program is distributed in the hope that it will be useful,</span></div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span></div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> * GNU Lesser General Public License for more details.</span></div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  </div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#ifndef __UG__LIB_ALGEBRA__ORDERING_STRATEGIES_ALGORITHMS_IORDERING_ALGORITHM__</span></div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#define __UG__LIB_ALGEBRA__ORDERING_STRATEGIES_ALGORITHMS_IORDERING_ALGORITHM__</span></div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  </div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include "<a class="code" href="smart__pointer_8h.html">common/util/smart_pointer.h</a>"</span></div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  </div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="keyword">namespace </span><a class="code" href="namespaceug.html">ug</a>{</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  </div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">/*</span></div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> Interface for ordering algorithms. O_t denotes the ordering container type.</span></div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> Ordering algorithms have to implement</span></div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> compute() - triggers computation of an ordering</span></div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> as well as</span></div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> ordering() - returns a reference to an ordering of type O_t</span></div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> O_t usually is a std::vector<size_t></span></div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> G_t (not required here) denotes the underlying graph type, e.g.,</span></div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> a boost graph</span></div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment">*/</span></div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  </div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="keyword">template</span> <<span class="keyword">typename</span> TAlgebra, <span class="keyword">typename</span> O_t=std::vector<<span class="keywordtype">size_t</span>> ></div>
<div class="line"><a name="l00052"></a><span class="lineno"><a class="line" href="classug_1_1_i_ordering_algorithm.html"> 52</a></span> <span class="keyword">class </span><a class="code" href="classug_1_1_i_ordering_algorithm.html">IOrderingAlgorithm</a>{</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="keyword">public</span>:</div>
<div class="line"><a name="l00054"></a><span class="lineno"><a class="line" href="classug_1_1_i_ordering_algorithm.html#a1aa8fa341e7ef69d9e2b624d2d91d4db"> 54</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> TAlgebra::matrix_type <a class="code" href="classug_1_1_i_ordering_algorithm.html#a1aa8fa341e7ef69d9e2b624d2d91d4db">M_t</a>;</div>
<div class="line"><a name="l00055"></a><span class="lineno"><a class="line" href="classug_1_1_i_ordering_algorithm.html#a5786ae24632364a4c96ecc79379afa5e"> 55</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> TAlgebra::vector_type <a class="code" href="classug_1_1_i_ordering_algorithm.html#a5786ae24632364a4c96ecc79379afa5e">V_t</a>;</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  </div>
<div class="line"><a name="l00057"></a><span class="lineno"><a class="line" href="classug_1_1_i_ordering_algorithm.html#a3d997c4922a7c7ceb858315b9eb6afcd"> 57</a></span>  <a class="code" href="classug_1_1_i_ordering_algorithm.html#a3d997c4922a7c7ceb858315b9eb6afcd">IOrderingAlgorithm</a>(){}</div>
<div class="line"><a name="l00058"></a><span class="lineno"><a class="line" href="classug_1_1_i_ordering_algorithm.html#a28a8c6feb3fd3a5da23225917facba43"> 58</a></span>  <span class="keyword">virtual</span> <a class="code" href="classug_1_1_i_ordering_algorithm.html#a28a8c6feb3fd3a5da23225917facba43">~IOrderingAlgorithm</a>(){}</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  </div>
<div class="line"><a name="l00060"></a><span class="lineno"><a class="line" href="classug_1_1_i_ordering_algorithm.html#a87d9ea0974cf668ca88ed32dae3d102d"> 60</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classug_1_1_i_ordering_algorithm.html#a87d9ea0974cf668ca88ed32dae3d102d">compute</a>() = 0;</div>
<div class="line"><a name="l00061"></a><span class="lineno"><a class="line" href="classug_1_1_i_ordering_algorithm.html#a7e0e30ccf45e14a8d40a959bcd793f1d"> 61</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classug_1_1_i_ordering_algorithm.html#a7e0e30ccf45e14a8d40a959bcd793f1d">check</a>() = 0;</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  </div>
<div class="line"><a name="l00063"></a><span class="lineno"><a class="line" href="classug_1_1_i_ordering_algorithm.html#affaf320a93c010da26ff457dbfa43bbd"> 63</a></span>  <span class="keyword">virtual</span> O_t& <a class="code" href="classug_1_1_i_ordering_algorithm.html#affaf320a93c010da26ff457dbfa43bbd">ordering</a>() = 0;</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  </div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="comment">//lib_algebra only</span></div>
<div class="line"><a name="l00066"></a><span class="lineno"><a class="line" href="classug_1_1_i_ordering_algorithm.html#ae3bf4bc3c016413af09bc008f44948d8"> 66</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classug_1_1_i_ordering_algorithm.html#ae3bf4bc3c016413af09bc008f44948d8">init</a>(<a class="code" href="classug_1_1_i_ordering_algorithm.html#a1aa8fa341e7ef69d9e2b624d2d91d4db">M_t</a>*) = 0;</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="comment">//lib_disc</span></div>
<div class="line"><a name="l00068"></a><span class="lineno"><a class="line" href="classug_1_1_i_ordering_algorithm.html#a2eea7df4a74b8a1d68ea5be78f4fe8d7"> 68</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classug_1_1_i_ordering_algorithm.html#a2eea7df4a74b8a1d68ea5be78f4fe8d7">init</a>(<a class="code" href="classug_1_1_i_ordering_algorithm.html#a1aa8fa341e7ef69d9e2b624d2d91d4db">M_t</a>*, <span class="keyword">const</span> <a class="code" href="classug_1_1_i_ordering_algorithm.html#a5786ae24632364a4c96ecc79379afa5e">V_t</a>&) = 0;</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="comment">//lib_algebra only, induced matrix</span></div>
<div class="line"><a name="l00070"></a><span class="lineno"><a class="line" href="classug_1_1_i_ordering_algorithm.html#a7f511f02fc4dbb0fdabc6848ea944840"> 70</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classug_1_1_i_ordering_algorithm.html#a7f511f02fc4dbb0fdabc6848ea944840">init</a>(<a class="code" href="classug_1_1_i_ordering_algorithm.html#a1aa8fa341e7ef69d9e2b624d2d91d4db">M_t</a>*, <span class="keyword">const</span> std::vector<size_t>&) = 0;</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="comment">//lib_disc, induced matrix</span></div>
<div class="line"><a name="l00072"></a><span class="lineno"><a class="line" href="classug_1_1_i_ordering_algorithm.html#a9f9eda1682019ad849c58841bffc0c94"> 72</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classug_1_1_i_ordering_algorithm.html#a9f9eda1682019ad849c58841bffc0c94">init</a>(<a class="code" href="classug_1_1_i_ordering_algorithm.html#a1aa8fa341e7ef69d9e2b624d2d91d4db">M_t</a>*, <span class="keyword">const</span> <a class="code" href="classug_1_1_i_ordering_algorithm.html#a5786ae24632364a4c96ecc79379afa5e">V_t</a>&, <span class="keyword">const</span> std::vector<size_t>&) = 0;</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  </div>
<div class="line"><a name="l00074"></a><span class="lineno"><a class="line" href="classug_1_1_i_ordering_algorithm.html#a9329c91211c4b2612b5f221db1bb0162"> 74</a></span>  <span class="keyword">virtual</span> <a class="code" href="class_smart_ptr.html">SmartPtr<IOrderingAlgorithm<TAlgebra, O_t></a> > <a class="code" href="classug_1_1_i_ordering_algorithm.html#a9329c91211c4b2612b5f221db1bb0162">clone</a>() = 0;</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  </div>
<div class="line"><a name="l00076"></a><span class="lineno"><a class="line" href="classug_1_1_i_ordering_algorithm.html#ae7f89f7868ca349c133ef72a19cbc5c5"> 76</a></span>  <span class="keyword">virtual</span> <span class="keyword">const</span> <span class="keywordtype">char</span>* <a class="code" href="classug_1_1_i_ordering_algorithm.html#ae7f89f7868ca349c133ef72a19cbc5c5">name</a>() <span class="keyword">const</span> = 0;</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> };</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  </div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> } <span class="comment">//namespace</span></div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  </div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="preprocessor">#endif </span><span class="comment">//guard</span></div>
<div class="ttc" id="aclass_smart_ptr_html"><div class="ttname"><a href="class_smart_ptr.html">SmartPtr</a></div><div class="ttdef"><b>Definition:</b> smart_pointer.h:108</div></div>
<div class="ttc" id="aclassug_1_1_i_ordering_algorithm_html"><div class="ttname"><a href="classug_1_1_i_ordering_algorithm.html">ug::IOrderingAlgorithm</a></div><div class="ttdef"><b>Definition:</b> IOrderingAlgorithm.h:52</div></div>
<div class="ttc" id="aclassug_1_1_i_ordering_algorithm_html_a1aa8fa341e7ef69d9e2b624d2d91d4db"><div class="ttname"><a href="classug_1_1_i_ordering_algorithm.html#a1aa8fa341e7ef69d9e2b624d2d91d4db">ug::IOrderingAlgorithm::M_t</a></div><div class="ttdeci">TAlgebra::matrix_type M_t</div><div class="ttdef"><b>Definition:</b> IOrderingAlgorithm.h:54</div></div>
<div class="ttc" id="aclassug_1_1_i_ordering_algorithm_html_a28a8c6feb3fd3a5da23225917facba43"><div class="ttname"><a href="classug_1_1_i_ordering_algorithm.html#a28a8c6feb3fd3a5da23225917facba43">ug::IOrderingAlgorithm::~IOrderingAlgorithm</a></div><div class="ttdeci">virtual ~IOrderingAlgorithm()</div><div class="ttdef"><b>Definition:</b> IOrderingAlgorithm.h:58</div></div>
<div class="ttc" id="aclassug_1_1_i_ordering_algorithm_html_a2eea7df4a74b8a1d68ea5be78f4fe8d7"><div class="ttname"><a href="classug_1_1_i_ordering_algorithm.html#a2eea7df4a74b8a1d68ea5be78f4fe8d7">ug::IOrderingAlgorithm::init</a></div><div class="ttdeci">virtual void init(M_t *, const V_t &)=0</div></div>
<div class="ttc" id="aclassug_1_1_i_ordering_algorithm_html_a3d997c4922a7c7ceb858315b9eb6afcd"><div class="ttname"><a href="classug_1_1_i_ordering_algorithm.html#a3d997c4922a7c7ceb858315b9eb6afcd">ug::IOrderingAlgorithm::IOrderingAlgorithm</a></div><div class="ttdeci">IOrderingAlgorithm()</div><div class="ttdef"><b>Definition:</b> IOrderingAlgorithm.h:57</div></div>
<div class="ttc" id="aclassug_1_1_i_ordering_algorithm_html_a5786ae24632364a4c96ecc79379afa5e"><div class="ttname"><a href="classug_1_1_i_ordering_algorithm.html#a5786ae24632364a4c96ecc79379afa5e">ug::IOrderingAlgorithm::V_t</a></div><div class="ttdeci">TAlgebra::vector_type V_t</div><div class="ttdef"><b>Definition:</b> IOrderingAlgorithm.h:55</div></div>
<div class="ttc" id="aclassug_1_1_i_ordering_algorithm_html_a7e0e30ccf45e14a8d40a959bcd793f1d"><div class="ttname"><a href="classug_1_1_i_ordering_algorithm.html#a7e0e30ccf45e14a8d40a959bcd793f1d">ug::IOrderingAlgorithm::check</a></div><div class="ttdeci">virtual void check()=0</div></div>
<div class="ttc" id="aclassug_1_1_i_ordering_algorithm_html_a7f511f02fc4dbb0fdabc6848ea944840"><div class="ttname"><a href="classug_1_1_i_ordering_algorithm.html#a7f511f02fc4dbb0fdabc6848ea944840">ug::IOrderingAlgorithm::init</a></div><div class="ttdeci">virtual void init(M_t *, const std::vector< size_t > &)=0</div></div>
<div class="ttc" id="aclassug_1_1_i_ordering_algorithm_html_a87d9ea0974cf668ca88ed32dae3d102d"><div class="ttname"><a href="classug_1_1_i_ordering_algorithm.html#a87d9ea0974cf668ca88ed32dae3d102d">ug::IOrderingAlgorithm::compute</a></div><div class="ttdeci">virtual void compute()=0</div></div>
<div class="ttc" id="aclassug_1_1_i_ordering_algorithm_html_a9329c91211c4b2612b5f221db1bb0162"><div class="ttname"><a href="classug_1_1_i_ordering_algorithm.html#a9329c91211c4b2612b5f221db1bb0162">ug::IOrderingAlgorithm::clone</a></div><div class="ttdeci">virtual SmartPtr< IOrderingAlgorithm< TAlgebra, O_t > > clone()=0</div></div>
<div class="ttc" id="aclassug_1_1_i_ordering_algorithm_html_a9f9eda1682019ad849c58841bffc0c94"><div class="ttname"><a href="classug_1_1_i_ordering_algorithm.html#a9f9eda1682019ad849c58841bffc0c94">ug::IOrderingAlgorithm::init</a></div><div class="ttdeci">virtual void init(M_t *, const V_t &, const std::vector< size_t > &)=0</div></div>
<div class="ttc" id="aclassug_1_1_i_ordering_algorithm_html_ae3bf4bc3c016413af09bc008f44948d8"><div class="ttname"><a href="classug_1_1_i_ordering_algorithm.html#ae3bf4bc3c016413af09bc008f44948d8">ug::IOrderingAlgorithm::init</a></div><div class="ttdeci">virtual void init(M_t *)=0</div></div>
<div class="ttc" id="aclassug_1_1_i_ordering_algorithm_html_ae7f89f7868ca349c133ef72a19cbc5c5"><div class="ttname"><a href="classug_1_1_i_ordering_algorithm.html#ae7f89f7868ca349c133ef72a19cbc5c5">ug::IOrderingAlgorithm::name</a></div><div class="ttdeci">virtual const char * name() const =0</div></div>
<div class="ttc" id="aclassug_1_1_i_ordering_algorithm_html_affaf320a93c010da26ff457dbfa43bbd"><div class="ttname"><a href="classug_1_1_i_ordering_algorithm.html#affaf320a93c010da26ff457dbfa43bbd">ug::IOrderingAlgorithm::ordering</a></div><div class="ttdeci">virtual O_t & ordering()=0</div></div>
<div class="ttc" id="anamespaceug_html"><div class="ttname"><a href="namespaceug.html">ug</a></div><div class="ttdoc">the ug namespace</div></div>
<div class="ttc" id="asmart__pointer_8h_html"><div class="ttname"><a href="smart__pointer_8h.html">smart_pointer.h</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_80abd05104fe5ed4636c8ba64911e654.html">ugbase</a></li><li class="navelem"><a class="el" href="dir_2e5eee3e6a2607df2611cb3dc665a6d5.html">lib_algebra</a></li><li class="navelem"><a class="el" href="dir_66e57fba0fea70cd38eef9b3eea80a23.html">ordering_strategies</a></li><li class="navelem"><a class="el" href="dir_29c0b1ccd82dd464d3bc3299fd230337.html">algorithms</a></li><li class="navelem"><a class="el" href="_i_ordering_algorithm_8h.html">IOrderingAlgorithm.h</a></li>
<li class="footer">Generated on Mon Nov 18 2024 10:37:24 for ug4 by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.1 </li>
</ul>
</div>
</body>
</html>