_s_c_c__ordering_8h_source.html

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>ug4: ugbase/lib_algebra/ordering_strategies/algorithms/SCC_ordering.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
  extensions: ["tex2jax.js"],
  jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="http://cdn.mathjax.org/mathjax/latest/MathJax.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="extra_stylesheet.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr id="projectrow">
  <td id="projectalign">
   <div id="projectname">ug4
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "search/",'.html');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
  initMenu('',true,false,'search.php','Search');
  $(document).ready(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function() { init_codefold(0); });
/* @license-end */
</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">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('_s_c_c__ordering_8h_source.html',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>

<div class="header">
  <div class="headertitle"><div class="title">SCC_ordering.h</div></div>
</div><!--header-->
<div class="contents">
<a href="_s_c_c__ordering_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/*</span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> * Copyright (c) 2022:  G-CSC, Goethe University Frankfurt</span></div>
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> * Author: Lukas Larisch</span></div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> * </span></div>
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * This file is part of UG4.</span></div>
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> * </span></div>
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> * UG4 is free software: you can redistribute it and/or modify it under the</span></div>
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment"> * terms of the GNU Lesser General Public License version 3 (as published by the</span></div>
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment"> * Free Software Foundation) with the following additional attribution</span></div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment"> * requirements (according to LGPL/GPL v3 §7):</span></div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment"> * </span></div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment"> * (1) The following notice must be displayed in the Appropriate Legal Notices</span></div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment"> * of covered and combined works: &quot;Based on UG4 (www.ug4.org/license)&quot;.</span></div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment"> * </span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment"> * (2) The following notice must be displayed at a prominent place in the</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment"> * terminal output of covered works: &quot;Based on UG4 (www.ug4.org/license)&quot;.</span></div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment"> * </span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment"> * (3) The following bibliography is recommended for citation and must be</span></div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment"> * preserved in all covered files:</span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment"> * &quot;Reiter, S., Vogel, A., Heppner, I., Rupp, M., and Wittum, G. A massively</span></div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment"> *   parallel geometric multigrid solver on hierarchically distributed grids.</span></div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment"> *   Computing and visualization in science 16, 4 (2013), 151-164&quot;</span></div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment"> * &quot;Vogel, A., Reiter, S., Rupp, M., Nägel, A., and Wittum, G. UG4 -- a novel</span></div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment"> *   flexible software system for simulating pde based models on high performance</span></div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment"> *   computers. Computing and visualization in science 16, 4 (2013), 165-179&quot;</span></div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment"> * </span></div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment"> * This program is distributed in the hope that it will be useful,</span></div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span></div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="comment"> * GNU Lesser General Public License for more details.</span></div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="comment"> */</span></div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#ifndef UG_BASE_LIB_ALGEBRA_ORDERING_STRATEGIES_ALGORITHMS_SCC_ORDERING_H</span></div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#define UG_BASE_LIB_ALGEBRA_ORDERING_STRATEGIES_ALGORITHMS_SCC_ORDERING_H</span></div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="preprocessor">#include &lt;boost/graph/adjacency_list.hpp&gt;</span></div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="preprocessor">#include &lt;boost/graph/graph_traits.hpp&gt;</span></div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="preprocessor">#include &lt;boost/graph/properties.hpp&gt;</span></div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="preprocessor">#include &lt;boost/graph/graph_utility.hpp&gt;</span></div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">#include &lt;boost/graph/strong_components.hpp&gt;</span></div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="preprocessor">#include &quot;<a class="code" href="_i_ordering_algorithm_8h.html">IOrderingAlgorithm.h</a>&quot;</span></div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="preprocessor">#include &quot;<a class="code" href="topological__ordering_8h.html">topological_ordering.h</a>&quot;</span></div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="preprocessor">#include &quot;<a class="code" href="lib__algebra_2vector__interface_2util_8h.html">util.h</a>&quot;</span></div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="preprocessor">#include &quot;<a class="code" href="permutation__util_8h.html">lib_algebra/algebra_common/permutation_util.h</a>&quot;</span></div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="comment">//debug</span></div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="preprocessor">#include &quot;<a class="code" href="common_2error_8h.html">common/error.h</a>&quot;</span></div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="preprocessor">#include &quot;<a class="code" href="log_8h.html">common/log.h</a>&quot;</span></div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceug.html">ug</a>{</div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> TAlgebra, <span class="keyword">typename</span> O_t&gt;</div>
<div class="foldopen" id="foldopen00056" data-start="{" data-end="};">
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html">   56</a></span><span class="keyword">class </span><a class="code hl_class" href="classug_1_1_s_c_c_ordering.html">SCCOrdering</a> : <span class="keyword">public</span> <a class="code hl_class" href="classug_1_1_i_ordering_algorithm.html">IOrderingAlgorithm</a>&lt;TAlgebra, O_t&gt;</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>{</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="keyword">public</span>:</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#ae219e52665da1a780a1e217c1702173f">   59</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> TAlgebra::matrix_type <a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#ae219e52665da1a780a1e217c1702173f">M_t</a>;</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#a8b4129d6601e4bd2d44b6e119a35d8b1">   60</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> TAlgebra::vector_type <a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#a8b4129d6601e4bd2d44b6e119a35d8b1">V_t</a>;</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#a32da0ac69686fd654e179d23fd1c043c">   61</a></span>  <span class="keyword">typedef</span> boost::adjacency_list&lt;boost::vecS, boost::vecS, boost::directedS&gt; <a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#a32da0ac69686fd654e179d23fd1c043c">G_t</a>;</div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#abc2887a08d0ebdcb68072379404fc8c7">   62</a></span>  <span class="keyword">typedef</span> <a class="code hl_class" href="classug_1_1_i_ordering_algorithm.html">IOrderingAlgorithm&lt;TAlgebra, O_t&gt;</a> <a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#abc2887a08d0ebdcb68072379404fc8c7">baseclass</a>;</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#a7fd16eb49b5d1187335524cd6a40b0cf">   64</a></span>  <span class="keyword">typedef</span> std::vector&lt;size_t&gt; <a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#a7fd16eb49b5d1187335524cd6a40b0cf">ordering_container_type</a>;</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#aa1773ca11c94846fd7b1f39e3666d130">   65</a></span>  <span class="keyword">typedef</span> <a class="code hl_class" href="classug_1_1_i_ordering_algorithm.html">IOrderingAlgorithm&lt;TAlgebra, ordering_container_type&gt;</a> <a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#aa1773ca11c94846fd7b1f39e3666d130">ordering_algo_type</a>;</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#acd5f198008386ae93cce212f8a8e3a25">   67</a></span>  <span class="keyword">typedef</span> boost::graph_traits&lt;G_t&gt;::vertex_descriptor <a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#acd5f198008386ae93cce212f8a8e3a25">vd_t</a>;</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#a16df68f528e9bb04c0ea1088a3caa2b0">   68</a></span>  <span class="keyword">typedef</span> boost::graph_traits&lt;G_t&gt;::vertex_iterator <a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#a16df68f528e9bb04c0ea1088a3caa2b0">vIt_t</a>;</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#af7e33f52f62242b00e97d1af9bbdec81">   69</a></span>  <span class="keyword">typedef</span> boost::graph_traits&lt;G_t&gt;::adjacency_iterator <a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#af7e33f52f62242b00e97d1af9bbdec81">nIt_t</a>;</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#a264b28fcaeab4e83f2d1054cb182814d">   70</a></span>  <span class="keyword">typedef</span> boost::graph_traits&lt;G_t&gt;::adjacency_iterator <a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#a264b28fcaeab4e83f2d1054cb182814d">adj_iter</a>;</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#aaf80440eba353a488e65b28d6a73c5e8">   71</a></span>  <span class="keyword">typedef</span> boost::graph_traits&lt;G_t&gt;::in_edge_iterator <a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#aaf80440eba353a488e65b28d6a73c5e8">inedge_iter</a>;</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#a66e70c72ba12cd1ffbeab79fd28a70c3">   73</a></span>  <a class="code hl_function" href="classug_1_1_s_c_c_ordering.html#a66e70c72ba12cd1ffbeab79fd28a70c3">SCCOrdering</a>(){}</div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
<div class="foldopen" id="foldopen00076" data-start="{" data-end="}">
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#ad9cf3846036194d94a2254231cafdf55">   76</a></span>  <a class="code hl_function" href="classug_1_1_s_c_c_ordering.html#ad9cf3846036194d94a2254231cafdf55">SCCOrdering</a>( <span class="keyword">const</span> <a class="code hl_class" href="classug_1_1_s_c_c_ordering.html">SCCOrdering&lt;TAlgebra, O_t&gt;</a> &amp;parent )</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>      : <a class="code hl_class" href="classug_1_1_i_ordering_algorithm.html">baseclass</a>(), <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#ac09f6dfe477ca61565c993ab43cba2de">m_spOrderingSubAlgo</a>(parent.<a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#ac09f6dfe477ca61565c993ab43cba2de">m_spOrderingSubAlgo</a>){}</div>
</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
<div class="foldopen" id="foldopen00079" data-start="{" data-end="}">
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#aee642b94dd9fa29753a1dd441c5cbc9d">   79</a></span>  <a class="code hl_class" href="class_smart_ptr.html">SmartPtr&lt;IOrderingAlgorithm&lt;TAlgebra, O_t&gt;</a> &gt; <a class="code hl_function" href="classug_1_1_s_c_c_ordering.html#aee642b94dd9fa29753a1dd441c5cbc9d">clone</a>()</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>  {</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="smart__pointer_8h.html#a6b709a70faa21f7ccb380ed2ab159cba">make_sp</a>(<span class="keyword">new</span> <a class="code hl_class" href="classug_1_1_s_c_c_ordering.html">SCCOrdering&lt;TAlgebra, O_t&gt;</a>(*<span class="keyword">this</span>));</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>  }</div>
</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
<div class="foldopen" id="foldopen00085" data-start="{" data-end="}">
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#aed352dc753cffd27b9db36a2fa85e8bc">   85</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="classug_1_1_s_c_c_ordering.html#aed352dc753cffd27b9db36a2fa85e8bc">set_ordering_subalgorithm</a>(<a class="code hl_class" href="class_smart_ptr.html">SmartPtr&lt;ordering_algo_type&gt;</a> ordering_subalgo){</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#ac09f6dfe477ca61565c993ab43cba2de">m_spOrderingSubAlgo</a> = ordering_subalgo;</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>  }</div>
</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
<div class="foldopen" id="foldopen00089" data-start="{" data-end="}">
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#aeef35da2f1f73ca1819312350ab72749">   89</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="classug_1_1_s_c_c_ordering.html#aeef35da2f1f73ca1819312350ab72749">compute</a>(){</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="keywordtype">unsigned</span> n = <a class="code hl_function" href="namespaceboost.html#a9a0147028d720cc8409c818ede288560">boost::num_vertices</a>(<a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#a47076e1ac1a8da96f743942b12294b2e">g</a>);</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="keywordflow">if</span>(n == 0){</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>      <a class="code hl_define" href="group__ugbase__common.html#ga43687df88af405f6ac7058dd3639993d">UG_THROW</a>(<a class="code hl_function" href="classug_1_1_s_c_c_ordering.html#a1e9946b23cf6ed84f6dcfe5bfa65ae57">name</a>() &lt;&lt; <span class="stringliteral">&quot;::compute: Graph is empty!&quot;</span>);</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>      <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    }</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    std::vector&lt;int&gt; component(n), discover_time(n);</div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    std::vector&lt;boost::default_color_type&gt; color(n);</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    std::vector&lt;vd_t&gt; root(n);</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <span class="keywordtype">size_t</span> num_components = boost::strong_components(<a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#a47076e1ac1a8da96f743942b12294b2e">g</a>,</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>      boost::make_iterator_property_map(component.begin(), <a class="code hl_function" href="namespaceboost.html#aac5ce1cabd03603aa8075ae91fa55ad5">boost::get</a>(boost::vertex_index, <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#a47076e1ac1a8da96f743942b12294b2e">g</a>)),</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>      boost::root_map(boost::make_iterator_property_map(root.begin(), <a class="code hl_function" href="namespaceboost.html#aac5ce1cabd03603aa8075ae91fa55ad5">boost::get</a>(boost::vertex_index, <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#a47076e1ac1a8da96f743942b12294b2e">g</a>)))</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>          .color_map(</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        boost::make_iterator_property_map(color.begin(), <a class="code hl_function" href="namespaceboost.html#aac5ce1cabd03603aa8075ae91fa55ad5">boost::get</a>(boost::vertex_index, <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#a47076e1ac1a8da96f743942b12294b2e">g</a>)))</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>          .discover_time_map(boost::make_iterator_property_map(</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        discover_time.begin(), <a class="code hl_function" href="namespaceboost.html#aac5ce1cabd03603aa8075ae91fa55ad5">boost::get</a>(boost::vertex_index, <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#a47076e1ac1a8da96f743942b12294b2e">g</a>))));</div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    std::vector&lt;std::vector&lt;vd_t&gt; &gt; comp_members(num_components);</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> i = 0; i &lt; n; ++i){</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>      comp_members[component[i]].push_back(i);</div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    }</div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span> </div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="comment">//create scc meta graph</span></div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#acd618b93a86834549883df1b4782c2f8">scc_g</a> = <a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#a32da0ac69686fd654e179d23fd1c043c">G_t</a>(num_components);</div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#a264b28fcaeab4e83f2d1054cb182814d">adj_iter</a> nIt, nEnd;</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <span class="keywordtype">size_t</span> i_comp, n_comp;</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> i = 0; i &lt; n; ++i){</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>      i_comp = component[i];</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>      <span class="keywordflow">for</span>(boost::tie(nIt, nEnd) = <a class="code hl_function" href="namespaceboost.html#a01d3760f0a47870b293327c4f62233b2">boost::adjacent_vertices</a>(i, <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#a47076e1ac1a8da96f743942b12294b2e">g</a>); nIt != nEnd; ++nIt){</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        n_comp = component[*nIt];</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        <span class="keywordflow">if</span>(i_comp != n_comp &amp;&amp; !boost::edge(i_comp, n_comp, <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#acd618b93a86834549883df1b4782c2f8">scc_g</a>).second){</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>          boost::add_edge(i_comp, n_comp, <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#acd618b93a86834549883df1b4782c2f8">scc_g</a>);</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        }</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>      }</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    }</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span> </div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    O_t scc_topo_ordering(num_components);</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <a class="code hl_function" href="namespaceug.html#adc05ffed8f227a30c174c1297cdb4753">topological_ordering_core_directed</a>(scc_topo_ordering, <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#acd618b93a86834549883df1b4782c2f8">scc_g</a>, <span class="keyword">true</span>); <span class="comment">//true = inverse</span></div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span> </div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="comment">//scc_topo_ordering is now a topological ordering of scc_g</span></div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span> </div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#a3e8a5ab84311c962566084f40b5cd790">o</a>.resize(n);</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span> </div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    <span class="keywordflow">if</span>(<a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#ac09f6dfe477ca61565c993ab43cba2de">m_spOrderingSubAlgo</a>.invalid()){</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>      <a class="code hl_define" href="group__ugbase__common.html#ga849480b16e1d7c49266a92cd5db63942">UG_LOG</a>(<a class="code hl_function" href="classug_1_1_s_c_c_ordering.html#a1e9946b23cf6ed84f6dcfe5bfa65ae57">name</a>() &lt;&lt; <span class="stringliteral">&quot;::compute: not using ordering subalgo\n&quot;</span>);</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>      <span class="comment">//enumerate members of components where components are iterated using the</span></div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>      <span class="comment">//topological ordering of the scc meta graph</span></div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span> </div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>      <span class="keywordtype">size_t</span> k = 0;</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>      <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> i = 0; i &lt; num_components; ++i){</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>        <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> j = 0; j &lt; comp_members[scc_topo_ordering[i]].size(); ++j){</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>          <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#a3e8a5ab84311c962566084f40b5cd790">o</a>[comp_members[scc_topo_ordering[i]][j]] = k++;</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>        }</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>      }</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    }</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    <span class="keywordflow">else</span>{</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>      <a class="code hl_define" href="group__ugbase__common.html#ga849480b16e1d7c49266a92cd5db63942">UG_LOG</a>(<a class="code hl_function" href="classug_1_1_s_c_c_ordering.html#a1e9946b23cf6ed84f6dcfe5bfa65ae57">name</a>() &lt;&lt; <span class="stringliteral">&quot;:compute: using &quot;</span> &lt;&lt; <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#ac09f6dfe477ca61565c993ab43cba2de">m_spOrderingSubAlgo</a>-&gt;name() &lt;&lt; <span class="stringliteral">&quot; as subalgo\n&quot;</span>);</div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span> </div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>      <span class="keywordtype">size_t</span> k = 0;</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>      <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> i = 0; i &lt; num_components; ++i){</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>        <span class="keywordtype">size_t</span> c_size = comp_members[scc_topo_ordering[i]].size();</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span> </div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>        <span class="keywordflow">if</span>(c_size == 1){</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>          <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#a3e8a5ab84311c962566084f40b5cd790">o</a>[comp_members[scc_topo_ordering[i]][0]] = k++;</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>        }</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>        <span class="keywordflow">else</span>{</div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>          <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#ac09f6dfe477ca61565c993ab43cba2de">m_spOrderingSubAlgo</a>-&gt;init(<a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#a69426b07fe5128ac0718359bbae9112d">m</a>, comp_members[scc_topo_ordering[i]]);</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>          <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#ac09f6dfe477ca61565c993ab43cba2de">m_spOrderingSubAlgo</a>-&gt;compute();</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>          std::vector&lt;size_t&gt;&amp; sub_o = <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#ac09f6dfe477ca61565c993ab43cba2de">m_spOrderingSubAlgo</a>-&gt;ordering();</div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>          std::vector&lt;size_t&gt; inv_sub_o;</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>          <a class="code hl_function" href="namespaceug.html#ab990c7b7c689dce2ef1657f095644247">GetInversePermutation</a>(sub_o, inv_sub_o);</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span> </div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>          <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> j = 0; j &lt; c_size; ++j){</div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>            <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#a3e8a5ab84311c962566084f40b5cd790">o</a>[comp_members[scc_topo_ordering[i]][inv_sub_o[j]]] = k++;</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>          }</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>        }</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>      }</div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span> </div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>      <a class="code hl_define" href="group__ugbase__common.html#gaf0ce958f12c62aa44c231a700b830374">UG_COND_THROW</a>(k != n, <span class="stringliteral">&quot;k!=n, k=&quot;</span> &lt;&lt; k &lt;&lt; <span class="stringliteral">&quot;, n=&quot;</span> &lt;&lt; n);</div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    }</div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span> </div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    <span class="comment">//reset</span></div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#acd618b93a86834549883df1b4782c2f8">scc_g</a> = <a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#a32da0ac69686fd654e179d23fd1c043c">G_t</a>(0);</div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#a47076e1ac1a8da96f743942b12294b2e">g</a> = <a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#a32da0ac69686fd654e179d23fd1c043c">G_t</a>(0);</div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span> </div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span><span class="preprocessor">    #ifdef UG_DEBUG</span></div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    <a class="code hl_function" href="classug_1_1_s_c_c_ordering.html#a2b272e2a4231fb7b6eeaae0f37e53227">check</a>();</div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span><span class="preprocessor">    #endif</span></div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>  }</div>
</div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span> </div>
<div class="foldopen" id="foldopen00183" data-start="{" data-end="}">
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#a2b272e2a4231fb7b6eeaae0f37e53227">  183</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="classug_1_1_s_c_c_ordering.html#a2b272e2a4231fb7b6eeaae0f37e53227">check</a>(){</div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    <a class="code hl_define" href="group__ugbase__common.html#gaf0ce958f12c62aa44c231a700b830374">UG_COND_THROW</a>(!<a class="code hl_function" href="namespaceug.html#a63c4b262038f11d2c9466ade1b55cc30">is_permutation</a>(<a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#a3e8a5ab84311c962566084f40b5cd790">o</a>), <a class="code hl_function" href="classug_1_1_s_c_c_ordering.html#a1e9946b23cf6ed84f6dcfe5bfa65ae57">name</a>() &lt;&lt; <span class="stringliteral">&quot;::check: Not a permutation!&quot;</span>);</div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>  }</div>
</div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span> </div>
<div class="foldopen" id="foldopen00187" data-start="{" data-end="}">
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#a63b0fceb770f5e6875bc7438b0d1cfdb">  187</a></span>  O_t&amp; <a class="code hl_function" href="classug_1_1_s_c_c_ordering.html#a63b0fceb770f5e6875bc7438b0d1cfdb">ordering</a>(){</div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    <span class="keywordflow">return</span> <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#a3e8a5ab84311c962566084f40b5cd790">o</a>;</div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>  }</div>
</div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span> </div>
<div class="foldopen" id="foldopen00191" data-start="{" data-end="}">
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#a3218dfc1cdfb07376a8da23a668851e8">  191</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="classug_1_1_s_c_c_ordering.html#a3218dfc1cdfb07376a8da23a668851e8">init</a>(<a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#ae219e52665da1a780a1e217c1702173f">M_t</a>* A, <span class="keyword">const</span> <a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#a8b4129d6601e4bd2d44b6e119a35d8b1">V_t</a>&amp;){</div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    <a class="code hl_functionRef" href="../plugins/group__small__strain__mechanics.html#gaf07906d860d20ad045f1718f42778749">init</a>(A);</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>  }</div>
</div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span> </div>
<div class="foldopen" id="foldopen00195" data-start="{" data-end="}">
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#ae9545a9ad713ee9e0df8a6dcffe3555e">  195</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="classug_1_1_s_c_c_ordering.html#ae9545a9ad713ee9e0df8a6dcffe3555e">init</a>(<a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#ae219e52665da1a780a1e217c1702173f">M_t</a>* A){</div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    <span class="comment">//TODO: replace this by UG_DLOG if permutation_util does not depend on this file anymore</span></div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span><span class="preprocessor">    #ifdef UG_ENABLE_DEBUG_LOGS</span></div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    <a class="code hl_define" href="group__ugbase__common.html#ga849480b16e1d7c49266a92cd5db63942">UG_LOG</a>(<span class="stringliteral">&quot;Using &quot;</span> &lt;&lt; <a class="code hl_function" href="classug_1_1_s_c_c_ordering.html#a1e9946b23cf6ed84f6dcfe5bfa65ae57">name</a>() &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>);</div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span><span class="preprocessor">    #endif</span></div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span> </div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#a69426b07fe5128ac0718359bbae9112d">m</a> = A;</div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span> </div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    <span class="keywordtype">unsigned</span> rows = A-&gt;num_rows();</div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span> </div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#a47076e1ac1a8da96f743942b12294b2e">g</a> = <a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#a32da0ac69686fd654e179d23fd1c043c">G_t</a>(rows);</div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span> </div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> i = 0; i &lt; rows; i++){</div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>      <span class="keywordflow">for</span>(<span class="keyword">typename</span> M_t::row_iterator conn = A-&gt;begin_row(i); conn != A-&gt;end_row(i); ++conn){</div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>        <span class="keywordflow">if</span>(conn.value() != 0.0 &amp;&amp; conn.index() != i){</div>
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>          boost::add_edge(i, conn.index(), <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#a47076e1ac1a8da96f743942b12294b2e">g</a>);</div>
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>        }</div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>      }</div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    }</div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>  }</div>
</div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span> </div>
<div class="foldopen" id="foldopen00216" data-start="{" data-end="}">
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#af3db8a4e2020bc9f1d24b3d86043dcd9">  216</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="classug_1_1_s_c_c_ordering.html#af3db8a4e2020bc9f1d24b3d86043dcd9">init</a>(<a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#ae219e52665da1a780a1e217c1702173f">M_t</a>*, <span class="keyword">const</span> <a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#a8b4129d6601e4bd2d44b6e119a35d8b1">V_t</a>&amp;, <span class="keyword">const</span> O_t&amp;){</div>
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    <a class="code hl_define" href="group__ugbase__common.html#ga43687df88af405f6ac7058dd3639993d">UG_THROW</a>(<a class="code hl_function" href="classug_1_1_s_c_c_ordering.html#a1e9946b23cf6ed84f6dcfe5bfa65ae57">name</a>() &lt;&lt; <span class="stringliteral">&quot;::init: Algorithm does not support induced subgraph version!&quot;</span>);</div>
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>  }</div>
</div>
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span> </div>
<div class="foldopen" id="foldopen00220" data-start="{" data-end="}">
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#af18d616e9b8c6d38c2427394949bb401">  220</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="classug_1_1_s_c_c_ordering.html#af18d616e9b8c6d38c2427394949bb401">init</a>(<a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#ae219e52665da1a780a1e217c1702173f">M_t</a>*, <span class="keyword">const</span> O_t&amp;){</div>
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>    <a class="code hl_define" href="group__ugbase__common.html#ga43687df88af405f6ac7058dd3639993d">UG_THROW</a>(<a class="code hl_function" href="classug_1_1_s_c_c_ordering.html#a1e9946b23cf6ed84f6dcfe5bfa65ae57">name</a>() &lt;&lt; <span class="stringliteral">&quot;::init: Algorithm does not support induced subgraph version!&quot;</span>);</div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>  }</div>
</div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span> </div>
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#a1e9946b23cf6ed84f6dcfe5bfa65ae57">  224</a></span>  <span class="keyword">virtual</span> <span class="keyword">const</span> <span class="keywordtype">char</span>* <a class="code hl_function" href="classug_1_1_s_c_c_ordering.html#a1e9946b23cf6ed84f6dcfe5bfa65ae57">name</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> <span class="stringliteral">&quot;SCCOrdering&quot;</span>;}</div>
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span> </div>
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span><span class="keyword">private</span>:</div>
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#a47076e1ac1a8da96f743942b12294b2e">  227</a></span>  <a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#a32da0ac69686fd654e179d23fd1c043c">G_t</a> <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#a47076e1ac1a8da96f743942b12294b2e">g</a>, <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#acd618b93a86834549883df1b4782c2f8">scc_g</a>;</div>
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#a3e8a5ab84311c962566084f40b5cd790">  228</a></span>  O_t <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#a3e8a5ab84311c962566084f40b5cd790">o</a>;</div>
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span> </div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#a69426b07fe5128ac0718359bbae9112d">  230</a></span>  <a class="code hl_typedef" href="classug_1_1_s_c_c_ordering.html#ae219e52665da1a780a1e217c1702173f">M_t</a>* <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#a69426b07fe5128ac0718359bbae9112d">m</a>;</div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span> </div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"><a class="line" href="classug_1_1_s_c_c_ordering.html#ac09f6dfe477ca61565c993ab43cba2de">  232</a></span>  <a class="code hl_class" href="class_smart_ptr.html">SmartPtr&lt;ordering_algo_type&gt;</a> <a class="code hl_variable" href="classug_1_1_s_c_c_ordering.html#ac09f6dfe477ca61565c993ab43cba2de">m_spOrderingSubAlgo</a>;</div>
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>};</div>
</div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span> </div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span> </div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>}</div>
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span> </div>
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span> </div>
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span><span class="preprocessor">#endif</span></div>
<div class="ttc" id="a_i_ordering_algorithm_8h_html"><div class="ttname"><a href="_i_ordering_algorithm_8h.html">IOrderingAlgorithm.h</a></div></div>
<div class="ttc" id="aclass_smart_ptr_html"><div class="ttname"><a href="class_smart_ptr.html">SmartPtr</a></div><div class="ttdef"><b>Definition</b> smart_pointer.h:108</div></div>
<div class="ttc" id="aclassug_1_1_i_ordering_algorithm_html"><div class="ttname"><a href="classug_1_1_i_ordering_algorithm.html">ug::IOrderingAlgorithm</a></div><div class="ttdef"><b>Definition</b> IOrderingAlgorithm.h:52</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html">ug::SCCOrdering</a></div><div class="ttdef"><b>Definition</b> SCC_ordering.h:57</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_a16df68f528e9bb04c0ea1088a3caa2b0"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#a16df68f528e9bb04c0ea1088a3caa2b0">ug::SCCOrdering::vIt_t</a></div><div class="ttdeci">boost::graph_traits&lt; G_t &gt;::vertex_iterator vIt_t</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:68</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_a1e9946b23cf6ed84f6dcfe5bfa65ae57"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#a1e9946b23cf6ed84f6dcfe5bfa65ae57">ug::SCCOrdering::name</a></div><div class="ttdeci">virtual const char * name() const</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:224</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_a264b28fcaeab4e83f2d1054cb182814d"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#a264b28fcaeab4e83f2d1054cb182814d">ug::SCCOrdering::adj_iter</a></div><div class="ttdeci">boost::graph_traits&lt; G_t &gt;::adjacency_iterator adj_iter</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:70</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_a2b272e2a4231fb7b6eeaae0f37e53227"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#a2b272e2a4231fb7b6eeaae0f37e53227">ug::SCCOrdering::check</a></div><div class="ttdeci">void check()</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:183</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_a3218dfc1cdfb07376a8da23a668851e8"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#a3218dfc1cdfb07376a8da23a668851e8">ug::SCCOrdering::init</a></div><div class="ttdeci">void init(M_t *A, const V_t &amp;)</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:191</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_a32da0ac69686fd654e179d23fd1c043c"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#a32da0ac69686fd654e179d23fd1c043c">ug::SCCOrdering::G_t</a></div><div class="ttdeci">boost::adjacency_list&lt; boost::vecS, boost::vecS, boost::directedS &gt; G_t</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:61</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_a3e8a5ab84311c962566084f40b5cd790"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#a3e8a5ab84311c962566084f40b5cd790">ug::SCCOrdering::o</a></div><div class="ttdeci">O_t o</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:228</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_a47076e1ac1a8da96f743942b12294b2e"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#a47076e1ac1a8da96f743942b12294b2e">ug::SCCOrdering::g</a></div><div class="ttdeci">G_t g</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:227</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_a63b0fceb770f5e6875bc7438b0d1cfdb"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#a63b0fceb770f5e6875bc7438b0d1cfdb">ug::SCCOrdering::ordering</a></div><div class="ttdeci">O_t &amp; ordering()</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:187</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_a66e70c72ba12cd1ffbeab79fd28a70c3"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#a66e70c72ba12cd1ffbeab79fd28a70c3">ug::SCCOrdering::SCCOrdering</a></div><div class="ttdeci">SCCOrdering()</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:73</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_a69426b07fe5128ac0718359bbae9112d"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#a69426b07fe5128ac0718359bbae9112d">ug::SCCOrdering::m</a></div><div class="ttdeci">M_t * m</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:230</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_a7fd16eb49b5d1187335524cd6a40b0cf"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#a7fd16eb49b5d1187335524cd6a40b0cf">ug::SCCOrdering::ordering_container_type</a></div><div class="ttdeci">std::vector&lt; size_t &gt; ordering_container_type</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:64</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_a8b4129d6601e4bd2d44b6e119a35d8b1"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#a8b4129d6601e4bd2d44b6e119a35d8b1">ug::SCCOrdering::V_t</a></div><div class="ttdeci">TAlgebra::vector_type V_t</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:60</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_aa1773ca11c94846fd7b1f39e3666d130"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#aa1773ca11c94846fd7b1f39e3666d130">ug::SCCOrdering::ordering_algo_type</a></div><div class="ttdeci">IOrderingAlgorithm&lt; TAlgebra, ordering_container_type &gt; ordering_algo_type</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:65</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_aaf80440eba353a488e65b28d6a73c5e8"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#aaf80440eba353a488e65b28d6a73c5e8">ug::SCCOrdering::inedge_iter</a></div><div class="ttdeci">boost::graph_traits&lt; G_t &gt;::in_edge_iterator inedge_iter</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:71</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_abc2887a08d0ebdcb68072379404fc8c7"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#abc2887a08d0ebdcb68072379404fc8c7">ug::SCCOrdering::baseclass</a></div><div class="ttdeci">IOrderingAlgorithm&lt; TAlgebra, O_t &gt; baseclass</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:62</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_ac09f6dfe477ca61565c993ab43cba2de"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#ac09f6dfe477ca61565c993ab43cba2de">ug::SCCOrdering::m_spOrderingSubAlgo</a></div><div class="ttdeci">SmartPtr&lt; ordering_algo_type &gt; m_spOrderingSubAlgo</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:232</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_acd5f198008386ae93cce212f8a8e3a25"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#acd5f198008386ae93cce212f8a8e3a25">ug::SCCOrdering::vd_t</a></div><div class="ttdeci">boost::graph_traits&lt; G_t &gt;::vertex_descriptor vd_t</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:67</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_acd618b93a86834549883df1b4782c2f8"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#acd618b93a86834549883df1b4782c2f8">ug::SCCOrdering::scc_g</a></div><div class="ttdeci">G_t scc_g</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:227</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_ad9cf3846036194d94a2254231cafdf55"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#ad9cf3846036194d94a2254231cafdf55">ug::SCCOrdering::SCCOrdering</a></div><div class="ttdeci">SCCOrdering(const SCCOrdering&lt; TAlgebra, O_t &gt; &amp;parent)</div><div class="ttdoc">clone constructor</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:76</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_ae219e52665da1a780a1e217c1702173f"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#ae219e52665da1a780a1e217c1702173f">ug::SCCOrdering::M_t</a></div><div class="ttdeci">TAlgebra::matrix_type M_t</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:59</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_ae9545a9ad713ee9e0df8a6dcffe3555e"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#ae9545a9ad713ee9e0df8a6dcffe3555e">ug::SCCOrdering::init</a></div><div class="ttdeci">void init(M_t *A)</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:195</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_aed352dc753cffd27b9db36a2fa85e8bc"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#aed352dc753cffd27b9db36a2fa85e8bc">ug::SCCOrdering::set_ordering_subalgorithm</a></div><div class="ttdeci">void set_ordering_subalgorithm(SmartPtr&lt; ordering_algo_type &gt; ordering_subalgo)</div><div class="ttdoc">sets an ordering algorithm</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:85</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_aee642b94dd9fa29753a1dd441c5cbc9d"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#aee642b94dd9fa29753a1dd441c5cbc9d">ug::SCCOrdering::clone</a></div><div class="ttdeci">SmartPtr&lt; IOrderingAlgorithm&lt; TAlgebra, O_t &gt; &gt; clone()</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:79</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_aeef35da2f1f73ca1819312350ab72749"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#aeef35da2f1f73ca1819312350ab72749">ug::SCCOrdering::compute</a></div><div class="ttdeci">void compute()</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:89</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_af18d616e9b8c6d38c2427394949bb401"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#af18d616e9b8c6d38c2427394949bb401">ug::SCCOrdering::init</a></div><div class="ttdeci">void init(M_t *, const O_t &amp;)</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:220</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_af3db8a4e2020bc9f1d24b3d86043dcd9"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#af3db8a4e2020bc9f1d24b3d86043dcd9">ug::SCCOrdering::init</a></div><div class="ttdeci">void init(M_t *, const V_t &amp;, const O_t &amp;)</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:216</div></div>
<div class="ttc" id="aclassug_1_1_s_c_c_ordering_html_af7e33f52f62242b00e97d1af9bbdec81"><div class="ttname"><a href="classug_1_1_s_c_c_ordering.html#af7e33f52f62242b00e97d1af9bbdec81">ug::SCCOrdering::nIt_t</a></div><div class="ttdeci">boost::graph_traits&lt; G_t &gt;::adjacency_iterator nIt_t</div><div class="ttdef"><b>Definition</b> SCC_ordering.h:69</div></div>
<div class="ttc" id="acommon_2error_8h_html"><div class="ttname"><a href="common_2error_8h.html">error.h</a></div></div>
<div class="ttc" id="agroup__small__strain__mechanics_html_gaf07906d860d20ad045f1718f42778749"><div class="ttname"><a href="../plugins/group__small__strain__mechanics.html#gaf07906d860d20ad045f1718f42778749">init</a></div><div class="ttdeci">virtual void init()</div></div>
<div class="ttc" id="agroup__ugbase__common_html_ga43687df88af405f6ac7058dd3639993d"><div class="ttname"><a href="group__ugbase__common.html#ga43687df88af405f6ac7058dd3639993d">UG_THROW</a></div><div class="ttdeci">#define UG_THROW(msg)</div><div class="ttdef"><b>Definition</b> error.h:57</div></div>
<div class="ttc" id="agroup__ugbase__common_html_ga849480b16e1d7c49266a92cd5db63942"><div class="ttname"><a href="group__ugbase__common.html#ga849480b16e1d7c49266a92cd5db63942">UG_LOG</a></div><div class="ttdeci">#define UG_LOG(msg)</div><div class="ttdef"><b>Definition</b> log.h:367</div></div>
<div class="ttc" id="agroup__ugbase__common_html_gaf0ce958f12c62aa44c231a700b830374"><div class="ttname"><a href="group__ugbase__common.html#gaf0ce958f12c62aa44c231a700b830374">UG_COND_THROW</a></div><div class="ttdeci">#define UG_COND_THROW(cond, msg)</div><div class="ttdoc">UG_COND_THROW(cond, msg) : performs a UG_THROW(msg) if cond == true.</div><div class="ttdef"><b>Definition</b> error.h:61</div></div>
<div class="ttc" id="alib__algebra_2vector__interface_2util_8h_html"><div class="ttname"><a href="lib__algebra_2vector__interface_2util_8h.html">util.h</a></div></div>
<div class="ttc" id="alog_8h_html"><div class="ttname"><a href="log_8h.html">log.h</a></div></div>
<div class="ttc" id="anamespaceboost_html_a01d3760f0a47870b293327c4f62233b2"><div class="ttname"><a href="namespaceboost.html#a01d3760f0a47870b293327c4f62233b2">boost::adjacent_vertices</a></div><div class="ttdeci">std::pair&lt; typename graph_traits&lt; T &gt;::adjacency_iterator, typename graph_traits&lt; T &gt;::adjacency_iterator &gt; adjacent_vertices(size_t v, ug::BidirectionalMatrix&lt; T &gt; const &amp;M)</div><div class="ttdef"><b>Definition</b> bidirectional_boost.h:108</div></div>
<div class="ttc" id="anamespaceboost_html_a9a0147028d720cc8409c818ede288560"><div class="ttname"><a href="namespaceboost.html#a9a0147028d720cc8409c818ede288560">boost::num_vertices</a></div><div class="ttdeci">int num_vertices(ug::BidirectionalMatrix&lt; T &gt; const &amp;M)</div><div class="ttdef"><b>Definition</b> bidirectional_boost.h:70</div></div>
<div class="ttc" id="anamespaceboost_html_aac5ce1cabd03603aa8075ae91fa55ad5"><div class="ttname"><a href="namespaceboost.html#aac5ce1cabd03603aa8075ae91fa55ad5">boost::get</a></div><div class="ttdeci">SM_edge_weight_map&lt; typename T::value_type, ug::BidirectionalMatrix&lt; T &gt; &gt; get(edge_weight_t, ug::BidirectionalMatrix&lt; T &gt; const &amp;g)</div><div class="ttdef"><b>Definition</b> bidirectional_boost.h:157</div></div>
<div class="ttc" id="anamespaceug_html"><div class="ttname"><a href="namespaceug.html">ug</a></div><div class="ttdoc">the ug namespace</div></div>
<div class="ttc" id="anamespaceug_html_a63c4b262038f11d2c9466ade1b55cc30"><div class="ttname"><a href="namespaceug.html#a63c4b262038f11d2c9466ade1b55cc30">ug::is_permutation</a></div><div class="ttdeci">bool is_permutation(O_t &amp;o)</div><div class="ttdef"><b>Definition</b> permutation_util.h:135</div></div>
<div class="ttc" id="anamespaceug_html_ab990c7b7c689dce2ef1657f095644247"><div class="ttname"><a href="namespaceug.html#ab990c7b7c689dce2ef1657f095644247">ug::GetInversePermutation</a></div><div class="ttdeci">bool GetInversePermutation(const std::vector&lt; size_t &gt; &amp;perm, std::vector&lt; size_t &gt; &amp;invPerm)</div><div class="ttdef"><b>Definition</b> permutation_util.cpp:39</div></div>
<div class="ttc" id="anamespaceug_html_adc05ffed8f227a30c174c1297cdb4753"><div class="ttname"><a href="namespaceug.html#adc05ffed8f227a30c174c1297cdb4753">ug::topological_ordering_core_directed</a></div><div class="ttdeci">void topological_ordering_core_directed(O_t &amp;o, G_t &amp;g, bool inverse)</div><div class="ttdef"><b>Definition</b> topological_ordering.h:142</div></div>
<div class="ttc" id="apermutation__util_8h_html"><div class="ttname"><a href="permutation__util_8h.html">permutation_util.h</a></div></div>
<div class="ttc" id="asmart__pointer_8h_html_a6b709a70faa21f7ccb380ed2ab159cba"><div class="ttname"><a href="smart__pointer_8h.html#a6b709a70faa21f7ccb380ed2ab159cba">make_sp</a></div><div class="ttdeci">SmartPtr&lt; T, FreePolicy &gt; make_sp(T *inst)</div><div class="ttdoc">returns a SmartPtr for the passed raw pointer</div><div class="ttdef"><b>Definition</b> smart_pointer.h:836</div></div>
<div class="ttc" id="atopological__ordering_8h_html"><div class="ttname"><a href="topological__ordering_8h.html">topological_ordering.h</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_80abd05104fe5ed4636c8ba64911e654.html">ugbase</a></li><li class="navelem"><a class="el" href="dir_2e5eee3e6a2607df2611cb3dc665a6d5.html">lib_algebra</a></li><li class="navelem"><a class="el" href="dir_66e57fba0fea70cd38eef9b3eea80a23.html">ordering_strategies</a></li><li class="navelem"><a class="el" href="dir_29c0b1ccd82dd464d3bc3299fd230337.html">algorithms</a></li><li class="navelem"><a class="el" href="_s_c_c__ordering_8h.html">SCC_ordering.h</a></li>
    <li class="footer">Generated on Mon Feb 24 2025 01:13:28 for ug4 by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
  </ul>
</div>
</body>
</html>