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