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
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://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.8.6"/>
<title>ViennaCL - The Vienna Computing Library: viennacl/misc/cuthill_mckee.hpp 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="navtree.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
$(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
$(document).ready(function() { searchBox.OnSelectItem(0); });
</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 style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">ViennaCL - The Vienna Computing Library
 <span id="projectnumber">1.7.1</span>
</div>
<div id="projectbrief">Free open-source GPU-accelerated linear algebra and solver library.</div>
</td>
<td> <div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<img id="MSearchSelect" src="search/mag_sel.png"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
alt=""/>
<input type="text" id="MSearchField" value="Search" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onkeyup="searchBox.OnSearchFieldChange(event)"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.6 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
</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">
$(document).ready(function(){initNavTree('cuthill__mckee_8hpp_source.html','');});
</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)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark"> </span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark"> </span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark"> </span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark"> </span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark"> </span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark"> </span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark"> </span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark"> </span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark"> </span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark"> </span>Friends</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(10)"><span class="SelectionMark"> </span>Macros</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(11)"><span class="SelectionMark"> </span>Pages</a></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">cuthill_mckee.hpp</div> </div>
</div><!--header-->
<div class="contents">
<a href="cuthill__mckee_8hpp.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="preprocessor">#ifndef VIENNACL_MISC_CUTHILL_MCKEE_HPP</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="preprocessor">#define VIENNACL_MISC_CUTHILL_MCKEE_HPP</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</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"> Copyright (c) 2010-2016, Institute for Microelectronics,</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> Institute for Analysis and Scientific Computing,</span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> TU Wien.</span></div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"> Portions of this software are copyright by UChicago Argonne, LLC.</span></div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment"></span></div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment"> -----------------</span></div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment"> ViennaCL - The Vienna Computing Library</span></div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment"> -----------------</span></div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"></span></div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> Project Head: Karl Rupp rupp@iue.tuwien.ac.at</span></div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"></span></div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment"> (A list of authors and contributors can be found in the manual)</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"> License: MIT (X11), see file LICENSE in the base directory</span></div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment">============================================================================= */</span></div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> </div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include <iostream></span></div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include <iterator></span></div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include <fstream></span></div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include <string></span></div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#include <algorithm></span></div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include <map></span></div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include <vector></span></div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include <deque></span></div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include <cmath></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="preprocessor">#include "<a class="code" href="forwards_8h.html">viennacl/forwards.h</a>"</span></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="keyword">namespace </span>viennacl</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> {</div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="keyword">namespace </span>detail</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> {</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> </div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">// Calculate the bandwidth of a reordered matrix</span></div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keyword">template</span><<span class="keyword">typename</span> IndexT, <span class="keyword">typename</span> ValueT></div>
<div class="line"><a name="l00047"></a><span class="lineno"><a class="line" href="namespaceviennacl_1_1detail.html#a91de3dbbe3f9a663fdbee15e1945fde2"> 47</a></span>  IndexT <a class="code" href="namespaceviennacl_1_1detail.html#a91de3dbbe3f9a663fdbee15e1945fde2">calc_reordered_bw</a>(std::vector< std::map<IndexT, ValueT> > <span class="keyword">const</span> & <a class="code" href="classviennacl_1_1matrix.html">matrix</a>,</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  std::vector<bool> & dof_assigned_to_node,</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  std::vector<IndexT> <span class="keyword">const</span> & permutation)</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>  IndexT bw = 0;</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> </div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> i = 0; i < permutation.size(); i++)</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  {</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordflow">if</span> (!dof_assigned_to_node[i])</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  IndexT min_index = <span class="keyword">static_cast<</span>IndexT<span class="keyword">></span>(<a class="code" href="classviennacl_1_1matrix.html">matrix</a>.size());</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  IndexT max_index = 0;</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">for</span> (<span class="keyword">typename</span> std::map<IndexT, ValueT>::const_iterator it = <a class="code" href="classviennacl_1_1matrix.html">matrix</a>[i].begin(); it != <a class="code" href="classviennacl_1_1matrix.html">matrix</a>[i].end(); it++)</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  {</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> col_index = <span class="keyword">static_cast<</span><a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a><span class="keyword">></span>(it->first);</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">if</span> (!dof_assigned_to_node[col_index])</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> </div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">if</span> (permutation[col_index] > max_index)</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  max_index = permutation[col_index];</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordflow">if</span> (permutation[col_index] < min_index)</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  min_index = permutation[col_index];</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  }</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">if</span> (max_index > min_index)</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  bw = <a class="code" href="namespaceviennacl_1_1linalg_1_1detail.html#a5d46fe9558b0e462f10fd44942ad4fc6">std::max</a>(bw, max_index - min_index);</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  }</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> </div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordflow">return</span> bw;</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  }</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> </div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="comment">// function to calculate the increment of combination comb.</span></div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="comment">// parameters:</span></div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="comment">// comb: pointer to vector<int> of size m, m <= n</span></div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="comment">// 1 <= comb[i] <= n for 0 <= i < m</span></div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">// comb[i] < comb[i+1] for 0 <= i < m - 1</span></div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="comment">// comb represents an ordered selection of m values out of n</span></div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">// n: int</span></div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">// total number of values out of which comb is taken as selection</span></div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">template</span><<span class="keyword">typename</span> IndexT></div>
<div class="line"><a name="l00089"></a><span class="lineno"><a class="line" href="namespaceviennacl_1_1detail.html#a46b125c9e12a72a453f0ff2885d0eafe"> 89</a></span>  <span class="keywordtype">bool</span> <a class="code" href="namespaceviennacl_1_1detail.html#a46b125c9e12a72a453f0ff2885d0eafe">comb_inc</a>(std::vector<IndexT> & comb, <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> n)</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  {</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> m;</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> k;</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> </div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  m = <span class="keyword">static_cast<</span><a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a><span class="keyword">></span>(comb.size());</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">// calculate k as highest possible index such that (*comb)[k-1] can be incremented</span></div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  k = m;</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">while</span> ( (k > 0) && ( ((k == m) && (comb[k-1] == static_cast<IndexT>(n)-1)) ||</div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  ((k < m) && (comb[k-1] == comb[k] - 1) )) )</div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  {</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  k--;</div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  }</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> </div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">if</span> (k == 0) <span class="comment">// no further increment of comb possible -> return false</span></div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> </div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  comb[k-1] += 1;</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> </div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">// and all higher index positions of comb are calculated just as directly following integer values</span></div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="comment">// Example (1, 4, 7) -> (1, 5, 6) -> (1, 5, 7) -> (1, 6, 7) -> done for n=7</span></div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> i = k; i < m; i++)</div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  comb[i] = comb[k-1] + IndexT(i - k);</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  }</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> </div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span> </div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="comment">// node s</span></div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keyword">template</span><<span class="keyword">typename</span> MatrixT, <span class="keyword">typename</span> IndexT></div>
<div class="line"><a name="l00122"></a><span class="lineno"><a class="line" href="namespaceviennacl_1_1detail.html#a0368076ca5c74ec328c48924db5feeb8"> 122</a></span>  <span class="keywordtype">void</span> <a class="code" href="namespaceviennacl_1_1detail.html#a0368076ca5c74ec328c48924db5feeb8">generate_layering</a>(MatrixT <span class="keyword">const</span> & <a class="code" href="classviennacl_1_1matrix.html">matrix</a>,</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  std::vector< std::vector<IndexT> > & layer_list)</div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  {</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  std::vector<bool> node_visited_already(matrix.size(), <span class="keyword">false</span>);</div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span> </div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="comment">// Step 1: Set root nodes to visited</span></div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> i=0; i<layer_list.size(); ++i)</div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  {</div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">for</span> (<span class="keyword">typename</span> std::vector<IndexT>::iterator it = layer_list[i].begin();</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  it != layer_list[i].end();</div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  it++)</div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  node_visited_already[*it] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  }</div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span> </div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="comment">// Step 2: Fill next layers</span></div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">while</span> (layer_list.back().size() > 0)</div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  {</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> layer_index = layer_list.size(); <span class="comment">//parent nodes are at layer 0</span></div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  layer_list.push_back(std::vector<IndexT>());</div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span> </div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">for</span> (<span class="keyword">typename</span> std::vector<IndexT>::iterator it = layer_list[layer_index].begin();</div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  it != layer_list[layer_index].end();</div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  it++)</div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  {</div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordflow">for</span> (<span class="keyword">typename</span> MatrixT::value_type::const_iterator it2 = matrix[*it].begin();</div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  it2 != matrix[*it].end();</div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  it2++)</div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  {</div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keywordflow">if</span> (it2->first == *it) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordflow">if</span> (node_visited_already[it2->first]) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span> </div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  layer_list.back().push_back(it2->first);</div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  node_visited_already[it2->first] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  }</div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  }</div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  }</div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span> </div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="comment">// remove last (empty) nodelist:</span></div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  layer_list.resize(layer_list.size()-1);</div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  }</div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span> </div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span> </div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="comment">// function to generate a node layering as a tree structure rooted at node s</span></div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keyword">template</span><<span class="keyword">typename</span> MatrixType></div>
<div class="line"><a name="l00170"></a><span class="lineno"><a class="line" href="namespaceviennacl_1_1detail.html#afc45d444ac8e66896ee5ba2b186a8510"> 170</a></span>  <span class="keywordtype">void</span> <a class="code" href="namespaceviennacl_1_1detail.html#a0368076ca5c74ec328c48924db5feeb8">generate_layering</a>(MatrixType <span class="keyword">const</span> & <a class="code" href="classviennacl_1_1matrix.html">matrix</a>,</div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  std::vector< std::vector<int> > & l,</div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordtype">int</span> s)</div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  {</div>
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> n = matrix.size();</div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="comment">//std::vector< std::vector<int> > l;</span></div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  std::vector<bool> inr(n, <span class="keyword">false</span>);</div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  std::vector<int> nlist;</div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span> </div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  nlist.push_back(s);</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  inr[<span class="keyword">static_cast<</span><a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a><span class="keyword">></span>(s)] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  l.push_back(nlist);</div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span> </div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordflow">for</span> (;;)</div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  {</div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  nlist.clear();</div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">for</span> (std::vector<int>::iterator it = l.back().begin();</div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  it != l.back().end();</div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  it++)</div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  {</div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">for</span> (<span class="keyword">typename</span> MatrixType::value_type::const_iterator it2 = matrix[static_cast<vcl_size_t>(*it)].begin();</div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  it2 != matrix[<span class="keyword">static_cast<</span><a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a><span class="keyword">></span>(*it)].end();</div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  it2++)</div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  {</div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordflow">if</span> (it2->first == *it) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordflow">if</span> (inr[static_cast<vcl_size_t>(it2->first)]) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span> </div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  nlist.push_back(it2->first);</div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  inr[<span class="keyword">static_cast<</span><a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a><span class="keyword">></span>(it2->first)] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  }</div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  }</div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span> </div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keywordflow">if</span> (nlist.size() == 0)</div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span> </div>
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  l.push_back(nlist);</div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  }</div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span> </div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  }</div>
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span> </div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keyword">template</span><<span class="keyword">typename</span> MatrixT, <span class="keyword">typename</span> IndexT></div>
<div class="line"><a name="l00215"></a><span class="lineno"><a class="line" href="namespaceviennacl_1_1detail.html#a1196927ad66b47cf5826181369c472d0"> 215</a></span>  <span class="keywordtype">void</span> <a class="code" href="namespaceviennacl_1_1detail.html#a1196927ad66b47cf5826181369c472d0">nodes_of_strongly_connected_component</a>(MatrixT <span class="keyword">const</span> & <a class="code" href="classviennacl_1_1matrix.html">matrix</a>,</div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  std::vector<IndexT> & node_list)</div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  {</div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  std::vector<bool> node_visited_already(matrix.size(), <span class="keyword">false</span>);</div>
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  std::deque<IndexT> node_queue;</div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span> </div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="comment">// Step 1: Push root nodes to queue:</span></div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordflow">for</span> (<span class="keyword">typename</span> std::vector<IndexT>::iterator it = node_list.begin();</div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  it != node_list.end();</div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  it++)</div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  {</div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  node_queue.push_back(*it);</div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  }</div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  node_list.resize(0);</div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span> </div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="comment">// Step 2: Fill with remaining nodes of strongly connected compontent</span></div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordflow">while</span> (!node_queue.empty())</div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  {</div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> node_id = <span class="keyword">static_cast<</span><a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a><span class="keyword">></span>(node_queue.front());</div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  node_queue.pop_front();</div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span> </div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keywordflow">if</span> (!node_visited_already[node_id])</div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  {</div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  node_list.push_back(IndexT(node_id));</div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  node_visited_already[node_id] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span> </div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keywordflow">for</span> (<span class="keyword">typename</span> MatrixT::value_type::const_iterator it = matrix[node_id].begin();</div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  it != matrix[node_id].end();</div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  it++)</div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  {</div>
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> neighbor_node_id = <span class="keyword">static_cast<</span><a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a><span class="keyword">></span>(it->first);</div>
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">if</span> (neighbor_node_id == node_id) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keywordflow">if</span> (node_visited_already[neighbor_node_id]) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span> </div>
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  node_queue.push_back(IndexT(neighbor_node_id));</div>
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  }</div>
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  }</div>
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  }</div>
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span> </div>
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  }</div>
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span> </div>
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span> </div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="comment">// comparison function for comparing two vector<int> values by their</span></div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="comment">// [1]-element</span></div>
<div class="line"><a name="l00263"></a><span class="lineno"><a class="line" href="namespaceviennacl_1_1detail.html#af4e69f290073504270f69f75bece0924"> 263</a></span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="namespaceviennacl_1_1detail.html#af4e69f290073504270f69f75bece0924">cuthill_mckee_comp_func</a>(std::vector<int> <span class="keyword">const</span> & a,</div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  std::vector<int> <span class="keyword">const</span> & b)</div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  {</div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordflow">return</span> (a[1] < b[1]);</div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  }</div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span> </div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keyword">template</span><<span class="keyword">typename</span> IndexT></div>
<div class="line"><a name="l00270"></a><span class="lineno"><a class="line" href="namespaceviennacl_1_1detail.html#a633f2200739984a3b78ac3e02496da03"> 270</a></span>  <span class="keywordtype">bool</span> <a class="code" href="namespaceviennacl_1_1detail.html#a633f2200739984a3b78ac3e02496da03">cuthill_mckee_comp_func_pair</a>(std::pair<IndexT, IndexT> <span class="keyword">const</span> & a,</div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  std::pair<IndexT, IndexT> <span class="keyword">const</span> & b)</div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  {</div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keywordflow">return</span> (a.second < b.second);</div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  }</div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span> </div>
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keyword">template</span><<span class="keyword">typename</span> IndexT, <span class="keyword">typename</span> ValueT></div>
<div class="line"><a name="l00287"></a><span class="lineno"><a class="line" href="namespaceviennacl_1_1detail.html#aeeba1f9a93970b70dbdf8eced30e167d"> 287</a></span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> <a class="code" href="namespaceviennacl_1_1detail.html#aeeba1f9a93970b70dbdf8eced30e167d">cuthill_mckee_on_strongly_connected_component</a>(std::vector< std::map<IndexT, ValueT> > <span class="keyword">const</span> & <a class="code" href="classviennacl_1_1matrix.html">matrix</a>,</div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  std::deque<IndexT> & node_assignment_queue,</div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  std::vector<bool> & dof_assigned_to_node,</div>
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  std::vector<IndexT> & permutation,</div>
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> current_dof)</div>
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  {</div>
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keyword">typedef</span> std::pair<IndexT, IndexT> NodeIdDegreePair; <span class="comment">//first member is the node ID, second member is the node degree</span></div>
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span> </div>
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  std::vector< NodeIdDegreePair > local_neighbor_nodes(<a class="code" href="classviennacl_1_1matrix.html">matrix</a>.size());</div>
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span> </div>
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keywordflow">while</span> (!node_assignment_queue.empty())</div>
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  {</div>
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="comment">// Grab first node from queue</span></div>
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> node_id = <span class="keyword">static_cast<</span><a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a><span class="keyword">></span>(node_assignment_queue.front());</div>
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  node_assignment_queue.pop_front();</div>
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span> </div>
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="comment">// Assign dof if a new dof hasn't been assigned yet</span></div>
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keywordflow">if</span> (!dof_assigned_to_node[node_id])</div>
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  {</div>
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  permutation[node_id] = <span class="keyword">static_cast<</span>IndexT<span class="keyword">></span>(current_dof); <span class="comment">//TODO: Invert this!</span></div>
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  ++current_dof;</div>
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  dof_assigned_to_node[node_id] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span> </div>
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="comment">// Get all neighbors of that node:</span></div>
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> num_neighbors = 0;</div>
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">for</span> (<span class="keyword">typename</span> std::map<IndexT, ValueT>::const_iterator neighbor_it = <a class="code" href="classviennacl_1_1matrix.html">matrix</a>[node_id].begin();</div>
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  neighbor_it != <a class="code" href="classviennacl_1_1matrix.html">matrix</a>[node_id].end();</div>
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  ++neighbor_it)</div>
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  {</div>
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> neighbor_node_index = <span class="keyword">static_cast<</span><a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a><span class="keyword">></span>(neighbor_it->first);</div>
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keywordflow">if</span> (!dof_assigned_to_node[neighbor_node_index])</div>
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  {</div>
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  local_neighbor_nodes[num_neighbors] = NodeIdDegreePair(neighbor_it->first, static_cast<IndexT>(<a class="code" href="classviennacl_1_1matrix.html">matrix</a>[neighbor_node_index].size()));</div>
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  ++num_neighbors;</div>
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  }</div>
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  }</div>
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span> </div>
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="comment">// Sort neighbors by increasing node degree</span></div>
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  std::sort(local_neighbor_nodes.begin(),</div>
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  local_neighbor_nodes.begin() + <span class="keyword">static_cast<</span>typename std::vector< NodeIdDegreePair >::difference_type<span class="keyword">></span>(num_neighbors),</div>
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  detail::cuthill_mckee_comp_func_pair<IndexT>);</div>
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span> </div>
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="comment">// Push neighbors to queue</span></div>
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> i=0; i<num_neighbors; ++i)</div>
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  node_assignment_queue.push_back(local_neighbor_nodes[i].first);</div>
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span> </div>
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  } <span class="comment">// if node doesn't have a new dof yet</span></div>
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span> </div>
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  } <span class="comment">// while nodes in queue</span></div>
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span> </div>
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">return</span> current_dof;</div>
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span> </div>
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  }</div>
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span> </div>
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span> } <span class="comment">//namespace detail</span></div>
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span> </div>
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span> <span class="comment">//</span></div>
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span> <span class="comment">// Part 1: The original Cuthill-McKee algorithm</span></div>
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span> <span class="comment">//</span></div>
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span> </div>
<div class="line"><a name="l00350"></a><span class="lineno"><a class="line" href="structviennacl_1_1cuthill__mckee__tag.html"> 350</a></span> <span class="keyword">struct </span><a class="code" href="structviennacl_1_1cuthill__mckee__tag.html">cuthill_mckee_tag</a> {};</div>
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span> </div>
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span> <span class="keyword">template</span><<span class="keyword">typename</span> IndexT, <span class="keyword">typename</span> ValueT></div>
<div class="line"><a name="l00367"></a><span class="lineno"><a class="line" href="namespaceviennacl.html#af22338e452cee008bee5e38070ddc611"> 367</a></span> std::vector<IndexT> <a class="code" href="namespaceviennacl.html#af22338e452cee008bee5e38070ddc611">reorder</a>(std::vector< std::map<IndexT, ValueT> > <span class="keyword">const</span> & <a class="code" href="classviennacl_1_1matrix.html">matrix</a>, <a class="code" href="structviennacl_1_1cuthill__mckee__tag.html">cuthill_mckee_tag</a>)</div>
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span> {</div>
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  std::vector<IndexT> permutation(<a class="code" href="classviennacl_1_1matrix.html">matrix</a>.size());</div>
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  std::vector<bool> dof_assigned_to_node(<a class="code" href="classviennacl_1_1matrix.html">matrix</a>.size(), <span class="keyword">false</span>); <span class="comment">//flag vector indicating whether node i has received a new dof</span></div>
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  std::deque<IndexT> node_assignment_queue;</div>
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span> </div>
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> current_dof = 0; <span class="comment">//the dof to be assigned</span></div>
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span> </div>
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keywordflow">while</span> (current_dof < <a class="code" href="classviennacl_1_1matrix.html">matrix</a>.size()) <span class="comment">//outer loop for each strongly connected component (there may be more than one)</span></div>
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  {</div>
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="comment">// preprocessing: Determine node degrees for nodes which have not been assigned</span></div>
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> current_min_degree = <a class="code" href="classviennacl_1_1matrix.html">matrix</a>.size();</div>
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> node_with_minimum_degree = 0;</div>
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keywordtype">bool</span> found_unassigned_node = <span class="keyword">false</span>;</div>
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> i=0; i<<a class="code" href="classviennacl_1_1matrix.html">matrix</a>.size(); ++i)</div>
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  {</div>
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">if</span> (!dof_assigned_to_node[i])</div>
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  {</div>
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordflow">if</span> (<a class="code" href="classviennacl_1_1matrix.html">matrix</a>[i].<a class="code" href="namespaceviennacl_1_1traits.html#aa2344ea20469f55fbc15a8e9526494d0">size</a>() == 1) <span class="comment">//This is an isolated node, so assign DOF right away</span></div>
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  {</div>
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  permutation[i] = <span class="keyword">static_cast<</span>IndexT<span class="keyword">></span>(current_dof);</div>
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  dof_assigned_to_node[i] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  ++current_dof;</div>
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  }</div>
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span> </div>
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="keywordflow">if</span> (!found_unassigned_node) <span class="comment">//initialize minimum degree on first node without new dof</span></div>
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  {</div>
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  current_min_degree = <a class="code" href="classviennacl_1_1matrix.html">matrix</a>[i].size();</div>
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  node_with_minimum_degree = i;</div>
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  found_unassigned_node = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  }</div>
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span> </div>
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keywordflow">if</span> (<a class="code" href="classviennacl_1_1matrix.html">matrix</a>[i].<a class="code" href="namespaceviennacl_1_1traits.html#aa2344ea20469f55fbc15a8e9526494d0">size</a>() < current_min_degree) <span class="comment">//found a node with smaller degree</span></div>
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  {</div>
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  current_min_degree = <a class="code" href="classviennacl_1_1matrix.html">matrix</a>[i].size();</div>
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  node_with_minimum_degree = i;</div>
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  }</div>
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  }</div>
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  }</div>
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span> </div>
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="comment">// Stage 2: Distribute dofs on this closely connected (sub-)graph in a breath-first manner using one root node</span></div>
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keywordflow">if</span> (found_unassigned_node) <span class="comment">// there's work to be done</span></div>
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  {</div>
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  node_assignment_queue.push_back(static_cast<IndexT>(node_with_minimum_degree));</div>
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  current_dof = <a class="code" href="namespaceviennacl_1_1detail.html#aeeba1f9a93970b70dbdf8eced30e167d">detail::cuthill_mckee_on_strongly_connected_component</a>(<a class="code" href="classviennacl_1_1matrix.html">matrix</a>, node_assignment_queue, dof_assigned_to_node, permutation, current_dof);</div>
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  }</div>
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  }</div>
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span> </div>
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keywordflow">return</span> permutation;</div>
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span> }</div>
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span> </div>
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span> </div>
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="comment">//</span></div>
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span> <span class="comment">// Part 2: Advanced Cuthill McKee</span></div>
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span> <span class="comment">//</span></div>
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span> </div>
<div class="line"><a name="l00429"></a><span class="lineno"><a class="line" href="classviennacl_1_1advanced__cuthill__mckee__tag.html"> 429</a></span> <span class="keyword">class </span><a class="code" href="classviennacl_1_1advanced__cuthill__mckee__tag.html">advanced_cuthill_mckee_tag</a></div>
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span> {</div>
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span> <span class="keyword">public</span>:</div>
<div class="line"><a name="l00450"></a><span class="lineno"><a class="line" href="classviennacl_1_1advanced__cuthill__mckee__tag.html#a47c0c7373388ac9d3bb6c9d267a5fcad"> 450</a></span>  <a class="code" href="classviennacl_1_1advanced__cuthill__mckee__tag.html#a47c0c7373388ac9d3bb6c9d267a5fcad">advanced_cuthill_mckee_tag</a>(<span class="keywordtype">double</span> a = 0.0, <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> gmax = 1) : starting_node_param_(a), max_root_nodes_(gmax) {}</div>
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span> </div>
<div class="line"><a name="l00452"></a><span class="lineno"><a class="line" href="classviennacl_1_1advanced__cuthill__mckee__tag.html#a82bfbe58efcc1d72e8f6272bc1dd854f"> 452</a></span>  <span class="keywordtype">double</span> <a class="code" href="classviennacl_1_1advanced__cuthill__mckee__tag.html#a82bfbe58efcc1d72e8f6272bc1dd854f">starting_node_param</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> starting_node_param_;}</div>
<div class="line"><a name="l00453"></a><span class="lineno"><a class="line" href="classviennacl_1_1advanced__cuthill__mckee__tag.html#ab40d5b9c822299e7145aae06c5da1386"> 453</a></span>  <span class="keywordtype">void</span> <a class="code" href="classviennacl_1_1advanced__cuthill__mckee__tag.html#ab40d5b9c822299e7145aae06c5da1386">starting_node_param</a>(<span class="keywordtype">double</span> a) { <span class="keywordflow">if</span> (a >= 0) starting_node_param_ = a; }</div>
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span> </div>
<div class="line"><a name="l00455"></a><span class="lineno"><a class="line" href="classviennacl_1_1advanced__cuthill__mckee__tag.html#a6101d20e1e6604e0e88ee929c7ab489a"> 455</a></span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> <a class="code" href="classviennacl_1_1advanced__cuthill__mckee__tag.html#a6101d20e1e6604e0e88ee929c7ab489a">max_root_nodes</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> max_root_nodes_; }</div>
<div class="line"><a name="l00456"></a><span class="lineno"><a class="line" href="classviennacl_1_1advanced__cuthill__mckee__tag.html#ac6c2efbeb33e17c217b5565c8083d754"> 456</a></span>  <span class="keywordtype">void</span> <a class="code" href="classviennacl_1_1advanced__cuthill__mckee__tag.html#ac6c2efbeb33e17c217b5565c8083d754">max_root_nodes</a>(<a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> gmax) { max_root_nodes_ = gmax; }</div>
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span> </div>
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span> <span class="keyword">private</span>:</div>
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keywordtype">double</span> starting_node_param_;</div>
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> max_root_nodes_;</div>
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span> };</div>
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span> </div>
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span> </div>
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span> </div>
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span> <span class="keyword">template</span><<span class="keyword">typename</span> IndexT, <span class="keyword">typename</span> ValueT></div>
<div class="line"><a name="l00474"></a><span class="lineno"><a class="line" href="namespaceviennacl.html#a032f691cd245d13b51b951f8a10825f3"> 474</a></span> std::vector<IndexT> <a class="code" href="namespaceviennacl.html#af22338e452cee008bee5e38070ddc611">reorder</a>(std::vector< std::map<IndexT, ValueT> > <span class="keyword">const</span> & <a class="code" href="classviennacl_1_1matrix.html">matrix</a>,</div>
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <a class="code" href="classviennacl_1_1advanced__cuthill__mckee__tag.html">advanced_cuthill_mckee_tag</a> <span class="keyword">const</span> & tag)</div>
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span> {</div>
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> n = <a class="code" href="classviennacl_1_1matrix.html">matrix</a>.size();</div>
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keywordtype">double</span> a = tag.<a class="code" href="classviennacl_1_1advanced__cuthill__mckee__tag.html#a82bfbe58efcc1d72e8f6272bc1dd854f">starting_node_param</a>();</div>
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> gmax = tag.<a class="code" href="classviennacl_1_1advanced__cuthill__mckee__tag.html#a6101d20e1e6604e0e88ee929c7ab489a">max_root_nodes</a>();</div>
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  std::vector<IndexT> permutation(n);</div>
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  std::vector<bool> dof_assigned_to_node(n, <span class="keyword">false</span>);</div>
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  std::vector<IndexT> nodes_in_strongly_connected_component;</div>
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  std::vector<IndexT> parent_nodes;</div>
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> deg_min;</div>
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> deg_max;</div>
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> deg_a;</div>
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> deg;</div>
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  std::vector<IndexT> comb;</div>
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span> </div>
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  nodes_in_strongly_connected_component.reserve(n);</div>
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  parent_nodes.reserve(n);</div>
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  comb.reserve(n);</div>
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span> </div>
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> current_dof = 0;</div>
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span> </div>
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keywordflow">while</span> (current_dof < <a class="code" href="classviennacl_1_1matrix.html">matrix</a>.size()) <span class="comment">// for all strongly connected components</span></div>
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  {</div>
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="comment">// get all nodes of the strongly connected component:</span></div>
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  nodes_in_strongly_connected_component.resize(0);</div>
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> i = 0; i < n; i++)</div>
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  {</div>
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keywordflow">if</span> (!dof_assigned_to_node[i])</div>
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  {</div>
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  nodes_in_strongly_connected_component.push_back(static_cast<IndexT>(i));</div>
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <a class="code" href="namespaceviennacl_1_1detail.html#a1196927ad66b47cf5826181369c472d0">detail::nodes_of_strongly_connected_component</a>(<a class="code" href="classviennacl_1_1matrix.html">matrix</a>, nodes_in_strongly_connected_component);</div>
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  }</div>
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  }</div>
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span> </div>
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="comment">// determine minimum and maximum node degree</span></div>
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  deg_min = 0;</div>
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  deg_max = 0;</div>
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keywordflow">for</span> (<span class="keyword">typename</span> std::vector<IndexT>::iterator it = nodes_in_strongly_connected_component.begin();</div>
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  it != nodes_in_strongly_connected_component.end();</div>
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  it++)</div>
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  {</div>
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  deg = <a class="code" href="classviennacl_1_1matrix.html">matrix</a>[<span class="keyword">static_cast<</span><a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a><span class="keyword">></span>(*it)].size();</div>
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="keywordflow">if</span> (deg_min == 0 || deg < deg_min)</div>
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  deg_min = deg;</div>
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordflow">if</span> (deg_max == 0 || deg > deg_max)</div>
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  deg_max = deg;</div>
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  }</div>
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  deg_a = deg_min + <span class="keyword">static_cast<</span><a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a><span class="keyword">></span>(a * double(deg_max - deg_min));</div>
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span> </div>
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="comment">// fill array of parent nodes:</span></div>
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  parent_nodes.<a class="code" href="classviennacl_1_1matrix.html#a69431725e09b2b73606dee084c962d7f">resize</a>(0);</div>
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keywordflow">for</span> (<span class="keyword">typename</span> std::vector<IndexT>::iterator it = nodes_in_strongly_connected_component.begin();</div>
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  it != nodes_in_strongly_connected_component.end();</div>
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  it++)</div>
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  {</div>
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keywordflow">if</span> (<a class="code" href="classviennacl_1_1matrix.html">matrix</a>[static_cast<vcl_size_t>(*it)].size() <= deg_a)</div>
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  parent_nodes.push_back(*it);</div>
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  }</div>
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span> </div>
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="comment">// backup current state in order to restore for every new combination of parent nodes below</span></div>
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  std::vector<bool> dof_assigned_to_node_backup = dof_assigned_to_node;</div>
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  std::vector<bool> dof_assigned_to_node_best;</div>
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span> </div>
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  std::vector<IndexT> permutation_backup = permutation;</div>
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  std::vector<IndexT> permutation_best = permutation;</div>
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span> </div>
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> current_dof_backup = current_dof;</div>
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span> </div>
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> g = 1;</div>
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  comb.resize(1);</div>
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  comb[0] = 0;</div>
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span> </div>
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  IndexT bw_best = 0;</div>
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span> </div>
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="comment">// Loop over all combinations of g <= gmax root nodes</span></div>
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span> </div>
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keywordflow">for</span> (;;)</div>
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  {</div>
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  dof_assigned_to_node = dof_assigned_to_node_backup;</div>
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  permutation = permutation_backup;</div>
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  current_dof = current_dof_backup;</div>
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span> </div>
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  std::deque<IndexT> node_queue;</div>
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span> </div>
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="comment">// add the selected root nodes according to actual combination comb to q</span></div>
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="keywordflow">for</span> (<span class="keyword">typename</span> std::vector<IndexT>::iterator it = comb.begin(); it != comb.end(); it++)</div>
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  node_queue.push_back(parent_nodes[static_cast<vcl_size_t>(*it)]);</div>
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span> </div>
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  current_dof = <a class="code" href="namespaceviennacl_1_1detail.html#aeeba1f9a93970b70dbdf8eced30e167d">detail::cuthill_mckee_on_strongly_connected_component</a>(<a class="code" href="classviennacl_1_1matrix.html">matrix</a>, node_queue, dof_assigned_to_node, permutation, current_dof);</div>
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span> </div>
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="comment">// calculate resulting bandwith for root node combination</span></div>
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="comment">// comb for current numbered component of the node graph</span></div>
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  IndexT bw = <a class="code" href="namespaceviennacl_1_1detail.html#a91de3dbbe3f9a663fdbee15e1945fde2">detail::calc_reordered_bw</a>(<a class="code" href="classviennacl_1_1matrix.html">matrix</a>, dof_assigned_to_node, permutation);</div>
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span> </div>
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="comment">// remember best ordering:</span></div>
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="keywordflow">if</span> (bw_best == 0 || bw < bw_best)</div>
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  {</div>
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  permutation_best = permutation;</div>
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  bw_best = bw;</div>
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  dof_assigned_to_node_best = dof_assigned_to_node;</div>
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  }</div>
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span> </div>
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="comment">// calculate next combination comb, if not existing</span></div>
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="comment">// increment g if g stays <= gmax, or else terminate loop</span></div>
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceviennacl_1_1detail.html#a46b125c9e12a72a453f0ff2885d0eafe">detail::comb_inc</a>(comb, parent_nodes.size()))</div>
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  {</div>
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  ++g;</div>
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keywordflow">if</span> ( (gmax > 0 && g > gmax) || g > parent_nodes.size())</div>
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span> </div>
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  comb.resize(g);</div>
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">vcl_size_t</a> i = 0; i < g; i++)</div>
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  comb[i] = static_cast<IndexT>(i);</div>
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  }</div>
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  }</div>
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span> </div>
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="comment">// restore best permutation</span></div>
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  permutation = permutation_best;</div>
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  dof_assigned_to_node = dof_assigned_to_node_best;</div>
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span> </div>
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  }</div>
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span> </div>
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  <span class="keywordflow">return</span> permutation;</div>
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span> }</div>
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span> </div>
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span> </div>
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span> } <span class="comment">//namespace viennacl</span></div>
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span> </div>
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span> </div>
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span> <span class="preprocessor">#endif</span></div>
<div class="ttc" id="namespaceviennacl_html_af22338e452cee008bee5e38070ddc611"><div class="ttname"><a href="namespaceviennacl.html#af22338e452cee008bee5e38070ddc611">viennacl::reorder</a></div><div class="ttdeci">std::vector< IndexT > reorder(std::vector< std::map< IndexT, ValueT > > const &matrix, cuthill_mckee_tag)</div><div class="ttdoc">Function for the calculation of a node number permutation to reduce the bandwidth of an incidence mat...</div><div class="ttdef"><b>Definition:</b> <a href="cuthill__mckee_8hpp_source.html#l00367">cuthill_mckee.hpp:367</a></div></div>
<div class="ttc" id="namespaceviennacl_1_1detail_html_a1196927ad66b47cf5826181369c472d0"><div class="ttname"><a href="namespaceviennacl_1_1detail.html#a1196927ad66b47cf5826181369c472d0">viennacl::detail::nodes_of_strongly_connected_component</a></div><div class="ttdeci">void nodes_of_strongly_connected_component(MatrixT const &matrix, std::vector< IndexT > &node_list)</div><div class="ttdoc">Fills the provided nodelist with all nodes of the same strongly connected component as the nodes in t...</div><div class="ttdef"><b>Definition:</b> <a href="cuthill__mckee_8hpp_source.html#l00215">cuthill_mckee.hpp:215</a></div></div>
<div class="ttc" id="classviennacl_1_1advanced__cuthill__mckee__tag_html_a47c0c7373388ac9d3bb6c9d267a5fcad"><div class="ttname"><a href="classviennacl_1_1advanced__cuthill__mckee__tag.html#a47c0c7373388ac9d3bb6c9d267a5fcad">viennacl::advanced_cuthill_mckee_tag::advanced_cuthill_mckee_tag</a></div><div class="ttdeci">advanced_cuthill_mckee_tag(double a=0.0, vcl_size_t gmax=1)</div><div class="ttdoc">CTOR which may take the additional parameters for the advanced algorithm. </div><div class="ttdef"><b>Definition:</b> <a href="cuthill__mckee_8hpp_source.html#l00450">cuthill_mckee.hpp:450</a></div></div>
<div class="ttc" id="forwards_8h_html"><div class="ttname"><a href="forwards_8h.html">forwards.h</a></div><div class="ttdoc">This file provides the forward declarations for the main types used within ViennaCL. </div></div>
<div class="ttc" id="classviennacl_1_1matrix_html"><div class="ttname"><a href="classviennacl_1_1matrix.html">viennacl::matrix</a></div><div class="ttdoc">A dense matrix class. </div><div class="ttdef"><b>Definition:</b> <a href="forwards_8h_source.html#l00375">forwards.h:375</a></div></div>
<div class="ttc" id="namespaceviennacl_1_1linalg_1_1detail_html_a5d46fe9558b0e462f10fd44942ad4fc6"><div class="ttname"><a href="namespaceviennacl_1_1linalg_1_1detail.html#a5d46fe9558b0e462f10fd44942ad4fc6">viennacl::linalg::detail::max</a></div><div class="ttdeci">T max(const T &lhs, const T &rhs)</div><div class="ttdoc">Maximum. </div><div class="ttdef"><b>Definition:</b> <a href="linalg_2detail_2bisect_2util_8hpp_source.html#l00059">util.hpp:59</a></div></div>
<div class="ttc" id="namespaceviennacl_1_1detail_html_a0368076ca5c74ec328c48924db5feeb8"><div class="ttname"><a href="namespaceviennacl_1_1detail.html#a0368076ca5c74ec328c48924db5feeb8">viennacl::detail::generate_layering</a></div><div class="ttdeci">void generate_layering(MatrixT const &matrix, std::vector< std::vector< IndexT > > &layer_list)</div><div class="ttdoc">Function to generate a node layering as a tree structure. </div><div class="ttdef"><b>Definition:</b> <a href="cuthill__mckee_8hpp_source.html#l00122">cuthill_mckee.hpp:122</a></div></div>
<div class="ttc" id="classviennacl_1_1matrix_html_a69431725e09b2b73606dee084c962d7f"><div class="ttname"><a href="classviennacl_1_1matrix.html#a69431725e09b2b73606dee084c962d7f">viennacl::matrix::resize</a></div><div class="ttdeci">void resize(size_type rows, size_type columns, bool preserve=true)</div><div class="ttdoc">Resizes the matrix. Existing entries can optionally be preserved. </div><div class="ttdef"><b>Definition:</b> <a href="matrix_8hpp_source.html#l00813">matrix.hpp:813</a></div></div>
<div class="ttc" id="classviennacl_1_1advanced__cuthill__mckee__tag_html_ab40d5b9c822299e7145aae06c5da1386"><div class="ttname"><a href="classviennacl_1_1advanced__cuthill__mckee__tag.html#ab40d5b9c822299e7145aae06c5da1386">viennacl::advanced_cuthill_mckee_tag::starting_node_param</a></div><div class="ttdeci">void starting_node_param(double a)</div><div class="ttdef"><b>Definition:</b> <a href="cuthill__mckee_8hpp_source.html#l00453">cuthill_mckee.hpp:453</a></div></div>
<div class="ttc" id="classviennacl_1_1advanced__cuthill__mckee__tag_html_a82bfbe58efcc1d72e8f6272bc1dd854f"><div class="ttname"><a href="classviennacl_1_1advanced__cuthill__mckee__tag.html#a82bfbe58efcc1d72e8f6272bc1dd854f">viennacl::advanced_cuthill_mckee_tag::starting_node_param</a></div><div class="ttdeci">double starting_node_param() const </div><div class="ttdef"><b>Definition:</b> <a href="cuthill__mckee_8hpp_source.html#l00452">cuthill_mckee.hpp:452</a></div></div>
<div class="ttc" id="namespaceviennacl_1_1traits_html_aa2344ea20469f55fbc15a8e9526494d0"><div class="ttname"><a href="namespaceviennacl_1_1traits.html#aa2344ea20469f55fbc15a8e9526494d0">viennacl::traits::size</a></div><div class="ttdeci">vcl_size_t size(VectorType const &vec)</div><div class="ttdoc">Generic routine for obtaining the size of a vector (ViennaCL, uBLAS, etc.) </div><div class="ttdef"><b>Definition:</b> <a href="size_8hpp_source.html#l00239">size.hpp:239</a></div></div>
<div class="ttc" id="classviennacl_1_1advanced__cuthill__mckee__tag_html_ac6c2efbeb33e17c217b5565c8083d754"><div class="ttname"><a href="classviennacl_1_1advanced__cuthill__mckee__tag.html#ac6c2efbeb33e17c217b5565c8083d754">viennacl::advanced_cuthill_mckee_tag::max_root_nodes</a></div><div class="ttdeci">void max_root_nodes(vcl_size_t gmax)</div><div class="ttdef"><b>Definition:</b> <a href="cuthill__mckee_8hpp_source.html#l00456">cuthill_mckee.hpp:456</a></div></div>
<div class="ttc" id="namespaceviennacl_1_1detail_html_aeeba1f9a93970b70dbdf8eced30e167d"><div class="ttname"><a href="namespaceviennacl_1_1detail.html#aeeba1f9a93970b70dbdf8eced30e167d">viennacl::detail::cuthill_mckee_on_strongly_connected_component</a></div><div class="ttdeci">vcl_size_t cuthill_mckee_on_strongly_connected_component(std::vector< std::map< IndexT, ValueT > > const &matrix, std::deque< IndexT > &node_assignment_queue, std::vector< bool > &dof_assigned_to_node, std::vector< IndexT > &permutation, vcl_size_t current_dof)</div><div class="ttdoc">Runs the Cuthill-McKee algorithm on a strongly connected component of a graph. </div><div class="ttdef"><b>Definition:</b> <a href="cuthill__mckee_8hpp_source.html#l00287">cuthill_mckee.hpp:287</a></div></div>
<div class="ttc" id="namespaceviennacl_html_a98a0afcc513111ffa0bd138f891930df"><div class="ttname"><a href="namespaceviennacl.html#a98a0afcc513111ffa0bd138f891930df">viennacl::vcl_size_t</a></div><div class="ttdeci">std::size_t vcl_size_t</div><div class="ttdef"><b>Definition:</b> <a href="forwards_8h_source.html#l00075">forwards.h:75</a></div></div>
<div class="ttc" id="classviennacl_1_1advanced__cuthill__mckee__tag_html_a6101d20e1e6604e0e88ee929c7ab489a"><div class="ttname"><a href="classviennacl_1_1advanced__cuthill__mckee__tag.html#a6101d20e1e6604e0e88ee929c7ab489a">viennacl::advanced_cuthill_mckee_tag::max_root_nodes</a></div><div class="ttdeci">vcl_size_t max_root_nodes() const </div><div class="ttdef"><b>Definition:</b> <a href="cuthill__mckee_8hpp_source.html#l00455">cuthill_mckee.hpp:455</a></div></div>
<div class="ttc" id="namespaceviennacl_1_1detail_html_a91de3dbbe3f9a663fdbee15e1945fde2"><div class="ttname"><a href="namespaceviennacl_1_1detail.html#a91de3dbbe3f9a663fdbee15e1945fde2">viennacl::detail::calc_reordered_bw</a></div><div class="ttdeci">IndexT calc_reordered_bw(std::vector< std::map< IndexT, ValueT > > const &matrix, std::vector< bool > &dof_assigned_to_node, std::vector< IndexT > const &permutation)</div><div class="ttdef"><b>Definition:</b> <a href="cuthill__mckee_8hpp_source.html#l00047">cuthill_mckee.hpp:47</a></div></div>
<div class="ttc" id="namespaceviennacl_1_1detail_html_a46b125c9e12a72a453f0ff2885d0eafe"><div class="ttname"><a href="namespaceviennacl_1_1detail.html#a46b125c9e12a72a453f0ff2885d0eafe">viennacl::detail::comb_inc</a></div><div class="ttdeci">bool comb_inc(std::vector< IndexT > &comb, vcl_size_t n)</div><div class="ttdef"><b>Definition:</b> <a href="cuthill__mckee_8hpp_source.html#l00089">cuthill_mckee.hpp:89</a></div></div>
<div class="ttc" id="namespaceviennacl_1_1detail_html_a633f2200739984a3b78ac3e02496da03"><div class="ttname"><a href="namespaceviennacl_1_1detail.html#a633f2200739984a3b78ac3e02496da03">viennacl::detail::cuthill_mckee_comp_func_pair</a></div><div class="ttdeci">bool cuthill_mckee_comp_func_pair(std::pair< IndexT, IndexT > const &a, std::pair< IndexT, IndexT > const &b)</div><div class="ttdef"><b>Definition:</b> <a href="cuthill__mckee_8hpp_source.html#l00270">cuthill_mckee.hpp:270</a></div></div>
<div class="ttc" id="classviennacl_1_1advanced__cuthill__mckee__tag_html"><div class="ttname"><a href="classviennacl_1_1advanced__cuthill__mckee__tag.html">viennacl::advanced_cuthill_mckee_tag</a></div><div class="ttdoc">Tag for the advanced Cuthill-McKee algorithm (i.e. running the 'standard' Cuthill-McKee algorithm for...</div><div class="ttdef"><b>Definition:</b> <a href="cuthill__mckee_8hpp_source.html#l00429">cuthill_mckee.hpp:429</a></div></div>
<div class="ttc" id="structviennacl_1_1cuthill__mckee__tag_html"><div class="ttname"><a href="structviennacl_1_1cuthill__mckee__tag.html">viennacl::cuthill_mckee_tag</a></div><div class="ttdoc">A tag class for selecting the Cuthill-McKee algorithm for reducing the bandwidth of a sparse matrix...</div><div class="ttdef"><b>Definition:</b> <a href="cuthill__mckee_8hpp_source.html#l00350">cuthill_mckee.hpp:350</a></div></div>
<div class="ttc" id="namespaceviennacl_1_1detail_html_af4e69f290073504270f69f75bece0924"><div class="ttname"><a href="namespaceviennacl_1_1detail.html#af4e69f290073504270f69f75bece0924">viennacl::detail::cuthill_mckee_comp_func</a></div><div class="ttdeci">bool cuthill_mckee_comp_func(std::vector< int > const &a, std::vector< int > const &b)</div><div class="ttdef"><b>Definition:</b> <a href="cuthill__mckee_8hpp_source.html#l00263">cuthill_mckee.hpp:263</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_c82e3d11dd171600f4a6e0cab1ec1e0d.html">viennacl</a></li><li class="navelem"><a class="el" href="dir_8e9f3cc091f3e773a2961f7e1b2269a2.html">misc</a></li><li class="navelem"><a class="el" href="cuthill__mckee_8hpp.html">cuthill_mckee.hpp</a></li>
<li class="footer">Generated on Wed Jan 20 2016 22:32:43 for ViennaCL - The Vienna Computing Library by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.6 </li>
</ul>
</div>
</body>
</html>
|
