-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1level_8hpp_source.html
230 lines (228 loc) · 24.7 KB
/
1level_8hpp_source.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
<!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.11.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>LAL: Linear Arrangement Library: lal/linarr/1level.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>
<script type="text/javascript" src="clipboard.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="cookie.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@2/MathJax.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">LAL: Linear Arrangement Library<span id="projectnumber"> 21.07.01</span>
</div>
<div id="projectbrief">A library focused on algorithms on linear arrangements of graphs.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.11.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
$(function() { codefold.init(0); });
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
$(function() {
initMenu('',true,false,'search.php','Search',false);
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
$(function(){ initResizable(false); });
/* @license-end */
</script>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_8f631ac29b6730c95cdd9d587311e2d3.html">lal</a></li><li class="navelem"><a class="el" href="dir_fc94e3b67d90f4da409ada728f5b788a.html">linarr</a></li> </ul>
</div>
</div><!-- top -->
<div id="doc-content">
<div class="header">
<div class="headertitle"><div class="title">1level.hpp</div></div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">/*********************************************************************</span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment"> *</span></div>
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment"> * Linear Arrangement Library - A library that implements a collection</span></div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment"> * algorithms for linear arrangments of graphs.</span></div>
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment"> *</span></div>
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment"> * Copyright (C) 2019 - 2021</span></div>
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment"> *</span></div>
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment"> * This file is part of Linear Arrangement Library. To see the full code</span></div>
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment"> * visit the webpage:</span></div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment"> * https://github.com/lluisalemanypuig/linear-arrangement-library.git</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"> * Linear Arrangement Library is free software: you can redistribute it</span></div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span><span class="comment"> * and/or modify it under the terms of the GNU Affero General Public License</span></div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="comment"> * as published by the Free Software Foundation, either version 3 of the</span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="comment"> * License, or (at your option) any later version.</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="comment"> *</span></div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="comment"> * Linear Arrangement Library is distributed in the hope that it will be</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="comment"> * useful, but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="comment"> * GNU Affero General Public License for more details.</span></div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="comment"> *</span></div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="comment"> * You should have received a copy of the GNU Affero General Public License</span></div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="comment"> * along with Linear Arrangement Library. If not, see <http://www.gnu.org/licenses/>.</span></div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="comment"> *</span></div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="comment"> * Contact:</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"> * Lluís Alemany Puig (lalemany@cs.upc.edu)</span></div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="comment"> * LARCA (Laboratory for Relational Algorithmics, Complexity and Learning)</span></div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="comment"> * CQL (Complexity and Quantitative Linguistics Lab)</span></div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="comment"> * Jordi Girona St 1-3, Campus Nord UPC, 08034 Barcelona. CATALONIA, SPAIN</span></div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="comment"> * Webpage: https://cqllab.upc.edu/people/lalemany/</span></div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="comment"> *</span></div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="comment"> * Ramon Ferrer i Cancho (rferrericancho@cs.upc.edu)</span></div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="comment"> * LARCA (Laboratory for Relational Algorithmics, Complexity and Learning)</span></div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span><span class="comment"> * CQL (Complexity and Quantitative Linguistics Lab)</span></div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="comment"> * Office S124, Omega building</span></div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="comment"> * Jordi Girona St 1-3, Campus Nord UPC, 08034 Barcelona. CATALONIA, SPAIN</span></div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="comment"> * Webpage: https://cqllab.upc.edu/people/rferrericancho/</span></div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span><span class="comment"> *</span></div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span><span class="comment"> ********************************************************************/</span></div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> </div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="preprocessor">#pragma once</span></div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> </div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span><span class="comment">// C++ includes</span></div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span><span class="preprocessor">#if defined DEBUG</span></div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span><span class="preprocessor">#include <cassert></span></div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span><span class="preprocessor">#include <vector></span></div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> </div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span><span class="comment">// lal includes</span></div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span><span class="preprocessor">#include <lal/definitions.hpp></span></div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span><span class="preprocessor">#include <lal/numeric/rational.hpp></span></div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span><span class="preprocessor">#include <lal/graphs/graph.hpp></span></div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> </div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacelal.html">lal</a> {</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="namespacelal_1_1linarr.html"> 56</a></span><span class="keyword">namespace </span>linarr {</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="comment">/* 1-LEVEL METRICS */</span></div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> </div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span><span class="comment">// **DEVELOPER NOTE**</span></div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span><span class="comment">// This function's documentation has to be updated manually in the python</span></div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span><span class="comment">// interface file '.i' 'python-interface/submodules/linarr.i'</span></div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span><span class="keyword">template</span><<span class="keyword">class</span> G></div>
<div class="foldopen" id="foldopen00087" data-start="{" data-end="}">
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"><a class="line" href="namespacelal_1_1linarr.html#ae3ff82b011435622d24736c216d605da"> 87</a></span><a class="code hl_class" href="classlal_1_1numeric_1_1rational.html">numeric::rational</a> <a class="code hl_function" href="namespacelal_1_1linarr.html#ae3ff82b011435622d24736c216d605da">mean_dependency_distance_1level_rational</a></div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span>(<span class="keyword">const</span> std::vector<G>& L, <span class="keyword">const</span> std::vector<linear_arrangement>& P = {})</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span><span class="keyword">noexcept</span></div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span>{</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keyword">static_assert</span>(std::is_base_of_v<graphs::graph, G>);</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> </div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span><span class="preprocessor">#if defined DEBUG</span></div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="comment">// the number of graphs and number of linear arrangements</span></div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="comment">// must coincide unless no arrangement was given.</span></div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> assert(P.size() == 0 or L.size() == P.size());</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> </div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> uint64_t sumD = 0;</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> uint64_t sumM = 0;</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="keywordflow">if</span> (P.size() == 0) {</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespacelal.html#afa9a90a785b8b5461c516b8a3971c558">linear_arrangement</a> empty_arr;</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < L.size(); ++i) {</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> sumD += <a class="code hl_function" href="namespacelal_1_1linarr.html#a4558fab36ed2a75572794f60a17c623f">sum_edge_lengths</a>(L[i], empty_arr);</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> sumM += L[i].get_num_edges();</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> }</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> <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < L.size(); ++i) {</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> sumD += <a class="code hl_function" href="namespacelal_1_1linarr.html#a4558fab36ed2a75572794f60a17c623f">sum_edge_lengths</a>(L[i], P[i]);</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> sumM += L[i].get_num_edges();</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="keywordflow">return</span> <a class="code hl_function" href="namespacelal_1_1numeric.html#a496da5fba64b6765c3299b6fd9cdc2aa">numeric::rational_from_ui</a>(sumD, sumM);</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span>}</div>
</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><span class="comment">// **DEVELOPER NOTE**</span></div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span><span class="comment">// This function's documentation has to be updated manually in the python</span></div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span><span class="comment">// interface file '.i' 'python-interface/submodules/linarr.i'</span></div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span><span class="keyword">template</span><<span class="keyword">class</span> G></div>
<div class="foldopen" id="foldopen00133" data-start="{" data-end="}">
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"><a class="line" href="namespacelal_1_1linarr.html#ae3ecf6602b92a3e82999baa2e54c8956"> 133</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="namespacelal_1_1linarr.html#ae3ecf6602b92a3e82999baa2e54c8956">mean_dependency_distance_1level</a></div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span>(<span class="keyword">const</span> std::vector<G>& L, <span class="keyword">const</span> std::vector<linear_arrangement>& P = {})</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span><span class="keyword">noexcept</span></div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span>{</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="keyword">static_assert</span>(std::is_base_of_v<graphs::graph, G>);</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <span class="keywordflow">return</span> <a class="code hl_function" href="namespacelal_1_1linarr.html#ae3ff82b011435622d24736c216d605da">mean_dependency_distance_1level_rational</a>(L, P).<a class="code hl_function" href="classlal_1_1numeric_1_1rational.html#ae2324f33fbc73e0c76a1f4e904706b92">to_double</a>();</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span>}</div>
</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="comment">// -- namespace linarr</span></div>
</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span>} <span class="comment">// -- namespace lal</span></div>
<div class="ttc" id="aclasslal_1_1numeric_1_1rational_html"><div class="ttname"><a href="classlal_1_1numeric_1_1rational.html">lal::numeric::rational</a></div><div class="ttdoc">Exact rational number.</div><div class="ttdef"><b>Definition</b> rational.hpp:63</div></div>
<div class="ttc" id="aclasslal_1_1numeric_1_1rational_html_ae2324f33fbc73e0c76a1f4e904706b92"><div class="ttname"><a href="classlal_1_1numeric_1_1rational.html#ae2324f33fbc73e0c76a1f4e904706b92">lal::numeric::rational::to_double</a></div><div class="ttdeci">double to_double() const noexcept</div><div class="ttdoc">Converts this rational to a double-precision floating-point value.</div><div class="ttdef"><b>Definition</b> rational.hpp:736</div></div>
<div class="ttc" id="anamespacelal_1_1linarr_html_a4558fab36ed2a75572794f60a17c623f"><div class="ttname"><a href="namespacelal_1_1linarr.html#a4558fab36ed2a75572794f60a17c623f">lal::linarr::sum_edge_lengths</a></div><div class="ttdeci">uint32_t sum_edge_lengths(const graphs::directed_graph &g, const linear_arrangement &pi={}) noexcept</div><div class="ttdoc">Computes the sum of the length of the edges in a linear arrangement.</div></div>
<div class="ttc" id="anamespacelal_1_1linarr_html_ae3ecf6602b92a3e82999baa2e54c8956"><div class="ttname"><a href="namespacelal_1_1linarr.html#ae3ecf6602b92a3e82999baa2e54c8956">lal::linarr::mean_dependency_distance_1level</a></div><div class="ttdeci">double mean_dependency_distance_1level(const std::vector< G > &L, const std::vector< linear_arrangement > &P={}) noexcept</div><div class="ttdoc">1-level Mean Dependency Distance over an ensemble of graphs.</div><div class="ttdef"><b>Definition</b> 1level.hpp:134</div></div>
<div class="ttc" id="anamespacelal_1_1linarr_html_ae3ff82b011435622d24736c216d605da"><div class="ttname"><a href="namespacelal_1_1linarr.html#ae3ff82b011435622d24736c216d605da">lal::linarr::mean_dependency_distance_1level_rational</a></div><div class="ttdeci">numeric::rational mean_dependency_distance_1level_rational(const std::vector< G > &L, const std::vector< linear_arrangement > &P={}) noexcept</div><div class="ttdoc">1-level Mean Dependency Distance over an ensemble of graphs.</div><div class="ttdef"><b>Definition</b> 1level.hpp:88</div></div>
<div class="ttc" id="anamespacelal_1_1numeric_html_a496da5fba64b6765c3299b6fd9cdc2aa"><div class="ttname"><a href="namespacelal_1_1numeric.html#a496da5fba64b6765c3299b6fd9cdc2aa">lal::numeric::rational_from_ui</a></div><div class="ttdeci">rational rational_from_ui(uint64_t n, uint64_t d=1) noexcept</div><div class="ttdoc">Make a rational value from two 64-bit unsigned integers.</div><div class="ttdef"><b>Definition</b> rational.hpp:800</div></div>
<div class="ttc" id="anamespacelal_html"><div class="ttname"><a href="namespacelal.html">lal</a></div><div class="ttdoc">Main namespace of the library.</div><div class="ttdef"><b>Definition</b> definitions.hpp:48</div></div>
<div class="ttc" id="anamespacelal_html_afa9a90a785b8b5461c516b8a3971c558"><div class="ttname"><a href="namespacelal.html#afa9a90a785b8b5461c516b8a3971c558">lal::linear_arrangement</a></div><div class="ttdeci">std::vector< position > linear_arrangement</div><div class="ttdoc">A linear arrangement of the nodes of a graph.</div><div class="ttdef"><b>Definition</b> definitions.hpp:72</div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.11.0
</small></address>
</div><!-- doc-content -->
</body>
</html>