1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
|
<!-- Copyright (c) 2020 ARM Limited. -->
<!-- -->
<!-- SPDX-License-Identifier: MIT -->
<!-- -->
<!-- HTML header for doxygen 1.8.13-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.17"/>
<meta name="robots" content="NOINDEX, NOFOLLOW" />
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>ArmNN: src/armnnUtils/GraphTopologicalSort.hpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="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="stylesheet.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<img alt="ArmNN" src="Arm_NN_horizontal_blue.png" style="max-width: 10rem; margin-top: .5rem; margin-left 10px"/>
<td style="padding-left: 0.5em;">
<div id="projectname">
 <span id="projectnumber">23.05</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.17 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('_graph_topological_sort_8hpp_source.xhtml',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle">
<div class="title">GraphTopologicalSort.hpp</div> </div>
</div><!--header-->
<div class="contents">
<a href="_graph_topological_sort_8hpp.xhtml">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">//</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Copyright © 2017 Arm Ltd. All rights reserved.</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// SPDX-License-Identifier: MIT</span></div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="preprocessor">#pragma once</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span>  </div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="preprocessor">#include <<a class="code" href="_optional_8hpp.xhtml">armnn/Optional.hpp</a>></span></div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span>  </div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="preprocessor">#include <functional></span></div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor">#include <map></span></div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="preprocessor">#include <stack></span></div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="preprocessor">#include <vector></span></div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span>  </div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="keyword">namespace </span><a class="code" href="namespacearmnn_utils.xhtml">armnnUtils</a></div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> {</div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span>  </div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="keyword">namespace</span></div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> {</div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>  </div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="keyword">enum class</span> NodeState</div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> {</div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  Visiting,</div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  Visited,</div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> };</div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  </div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  </div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="keyword">template</span> <<span class="keyword">typename</span> TNodeId></div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <a class="code" href="classarmnn_1_1_optional.xhtml">armnn::Optional<TNodeId></a> GetNextChild(TNodeId node,</div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  std::function<std::vector<TNodeId>(TNodeId)> getIncomingEdges,</div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  std::map<TNodeId, NodeState>& nodeStates)</div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> {</div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="keywordflow">for</span> (TNodeId childNode : getIncomingEdges(node))</div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  {</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keywordflow">if</span> (nodeStates.find(childNode) == nodeStates.end())</div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  {</div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="keywordflow">return</span> childNode;</div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  }</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  {</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="keywordflow">if</span> (nodeStates.find(childNode)->second == NodeState::Visiting)</div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  {</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keywordflow">return</span> childNode;</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  }</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  }</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  }</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  </div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keywordflow">return</span> {};</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> }</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  </div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="keyword">template</span><<span class="keyword">typename</span> TNodeId></div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="keywordtype">bool</span> TopologicallySort(</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  TNodeId initialNode,</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  std::function<std::vector<TNodeId>(TNodeId)> getIncomingEdges,</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  std::vector<TNodeId>& outSorted,</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  std::map<TNodeId, NodeState>& nodeStates)</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span> {</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  std::stack<TNodeId> nodeStack;</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  </div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">// If the node is never visited we should search it</span></div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keywordflow">if</span> (nodeStates.find(initialNode) == nodeStates.end())</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  {</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  nodeStack.push(initialNode);</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  }</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  </div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">while</span> (!nodeStack.empty())</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  {</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  TNodeId current = nodeStack.top();</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  </div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  nodeStates[current] = NodeState::Visiting;</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  </div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keyword">auto</span> nextChildOfCurrent = GetNextChild(current, getIncomingEdges, nodeStates);</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  </div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">if</span> (nextChildOfCurrent)</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  {</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  TNodeId nextChild = nextChildOfCurrent.value();</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  </div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="comment">// If the child has not been searched, add to the stack and iterate over this node</span></div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keywordflow">if</span> (nodeStates.find(nextChild) == nodeStates.end())</div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  {</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  nodeStack.push(nextChild);</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  }</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  </div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="comment">// If we re-encounter a node being visited there is a cycle</span></div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordflow">if</span> (nodeStates[nextChild] == NodeState::Visiting)</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  {</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  }</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  }</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  </div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  nodeStack.pop();</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  </div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  nodeStates[current] = NodeState::Visited;</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  outSorted.push_back(current);</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  }</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  </div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> }</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  </div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> }</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  </div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment">// Sorts a directed acyclic graph (DAG) into a flat list such that all inputs to a node are before the node itself.</span></div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment">// Returns true if successful or false if there is an error in the graph structure (e.g. it contains a cycle).</span></div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment">// The graph is defined entirely by the "getIncomingEdges" function which the user provides. For a given node,</span></div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment">// it must return the list of nodes which are required to come before it.</span></div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment">// "targetNodes" is the list of nodes where the search begins - i.e. the nodes that you want to evaluate.</span></div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment">// This is an iterative implementation based on https://en.wikipedia.org/wiki/Topological_sorting#Depth-first_search</span></div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="keyword">template</span><<span class="keyword">typename</span> TNodeId, <span class="keyword">typename</span> TTargetNodes></div>
<div class="line"><a name="l00110"></a><span class="lineno"><a class="line" href="namespacearmnn_utils.xhtml#a662b45b5a4d48a01e967c0b28b6a552b"> 110</a></span> <span class="keywordtype">bool</span> <a class="code" href="namespacearmnn_utils.xhtml#a662b45b5a4d48a01e967c0b28b6a552b">GraphTopologicalSort</a>(</div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keyword">const</span> TTargetNodes& targetNodes,</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  std::function<std::vector<TNodeId>(TNodeId)> getIncomingEdges,</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  std::vector<TNodeId>& outSorted)</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> {</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  outSorted.clear();</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  std::map<TNodeId, NodeState> nodeStates;</div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  </div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">for</span> (TNodeId targetNode : targetNodes)</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  {</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">if</span> (!TopologicallySort(targetNode, getIncomingEdges, outSorted, nodeStates))</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  {</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  }</div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  }</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  </div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span> }</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  </div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> }</div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<div class="ttc" id="anamespacearmnn_utils_xhtml_a662b45b5a4d48a01e967c0b28b6a552b"><div class="ttname"><a href="namespacearmnn_utils.xhtml#a662b45b5a4d48a01e967c0b28b6a552b">armnnUtils::GraphTopologicalSort</a></div><div class="ttdeci">bool GraphTopologicalSort(const TTargetNodes &targetNodes, std::function< std::vector< TNodeId >(TNodeId)> getIncomingEdges, std::vector< TNodeId > &outSorted)</div><div class="ttdef"><b>Definition:</b> <a href="_graph_topological_sort_8hpp_source.xhtml#l00110">GraphTopologicalSort.hpp:110</a></div></div>
<div class="ttc" id="a_optional_8hpp_xhtml"><div class="ttname"><a href="_optional_8hpp.xhtml">Optional.hpp</a></div></div>
<div class="ttc" id="anamespacearmnn_utils_xhtml"><div class="ttname"><a href="namespacearmnn_utils.xhtml">armnnUtils</a></div><div class="ttdef"><b>Definition:</b> <a href="_compatible_types_8hpp_source.xhtml#l00010">CompatibleTypes.hpp:10</a></div></div>
<div class="ttc" id="aclassarmnn_1_1_optional_xhtml"><div class="ttname"><a href="classarmnn_1_1_optional.xhtml">armnn::Optional</a></div><div class="ttdef"><b>Definition:</b> <a href="_optional_8hpp_source.xhtml#l00270">Optional.hpp:270</a></div></div>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.xhtml">src</a></li><li class="navelem"><a class="el" href="dir_5d9c764a006d252ff232a5efbbd99a46.xhtml">armnnUtils</a></li><li class="navelem"><a class="el" href="_graph_topological_sort_8hpp.xhtml">GraphTopologicalSort.hpp</a></li>
<li class="footer">Generated on Thu May 18 2023 10:35:41 for ArmNN by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.17 </li>
</ul>
</div>
</body>
</html>
|
