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
|
<!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.11"/>
<title>AudioManager: AudioManagerCore/include/CAmGraph.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>
<script type="text/javascript">
$(document).ready(initResizable);
$(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
$(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">AudioManager
 <span id="projectnumber">7.6.6</span>
</div>
<div id="projectbrief">Native Application Runtime Environment</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.11 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="modules.html"><span>Modules</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
<li>
<div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<img id="MSearchSelect" src="search/mag_sel.png"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
alt=""/>
<input type="text" id="MSearchField" value="Search" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onkeyup="searchBox.OnSearchFieldChange(event)"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
</span>
</div>
</li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>File Members</span></a></li>
</ul>
</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">
$(document).ready(function(){initNavTree('CAmGraph_8h_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</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">CAmGraph.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="CAmGraph_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> </div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#ifndef GRAPH_H</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#define GRAPH_H</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> <span class="preprocessor">#include <functional></span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include <iostream></span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include <map></span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include <list></span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#include <stack></span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include <queue></span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include <algorithm></span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include <limits.h></span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include <iomanip></span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include <cstring></span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#include <set></span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> </div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> </div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="keyword">namespace </span><a class="code" href="namespaceam.html">am</a></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> {</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keyword">typedef</span> <span class="keyword">enum</span>:uint8_t</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  {</div><div class="line"><a name="l00048"></a><span class="lineno"><a class="line" href="namespaceam.html#aa5ba1f024fafe67c566a642b23493bfe"> 48</a></span>  GES_NOT_VISITED,</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <a class="code" href="namespaceam.html#aa5ba1f024fafe67c566a642b23493bfe">GES_IN_PROGRESS</a>,</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  GES_VISITED</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  }<a class="code" href="namespaceam.html#ac85eb9c3b3735f8eea02a45482ce4943">am_GraphElementStatus_e</a>;</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> </div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keyword">typedef</span> <span class="keyword">enum</span>:uint8_t</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  {</div><div class="line"><a name="l00058"></a><span class="lineno"><a class="line" href="namespaceam.html#abb9b450360ced141aa4d58a18a2fdd8a"> 58</a></span>  GRAPH_PATH_START, <span class="comment">//at the beginning of the path</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <a class="code" href="namespaceam.html#abb9b450360ced141aa4d58a18a2fdd8a">GRAPH_PATH_MIDDLE</a>, <span class="comment">//in middle of the path</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  GRAPH_PATH_END <span class="comment">//at the end of the path</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  }<a class="code" href="namespaceam.html#a5ddc1de5c77502d9fd136f30a5ebbd7c">am_GraphPathPosition_e</a>;</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> </div><div class="line"><a name="l00067"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraphElement.html"> 67</a></span>  <span class="keyword">class </span><a class="code" href="classam_1_1CAmGraphElement.html">CAmGraphElement</a></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  {</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  am_GraphElementStatus_e mStatus; </div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00071"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraphElement.html#a2186720c61aa5768c28e29658c4eb898"> 71</a></span>  <a class="code" href="classam_1_1CAmGraphElement.html#a2186720c61aa5768c28e29658c4eb898">CAmGraphElement</a>(): mStatus(GES_NOT_VISITED) { };</div><div class="line"><a name="l00072"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraphElement.html#ad42b8df4de1c9aca747f406f28ceb03e"> 72</a></span>  <a class="code" href="classam_1_1CAmGraphElement.html#ad42b8df4de1c9aca747f406f28ceb03e">~CAmGraphElement</a>() { };</div><div class="line"><a name="l00076"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraphElement.html#adfa42a6ab9f619fc459cf0c3b025f17d"> 76</a></span>  <span class="keywordtype">void</span> <a class="code" href="classam_1_1CAmGraphElement.html#adfa42a6ab9f619fc459cf0c3b025f17d">setStatus</a>(<span class="keyword">const</span> am_GraphElementStatus_e s) { mStatus = s; };</div><div class="line"><a name="l00077"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraphElement.html#ab5f90ebf60b28be325744117caa28c7d"> 77</a></span>  am_GraphElementStatus_e <a class="code" href="classam_1_1CAmGraphElement.html#ab5f90ebf60b28be325744117caa28c7d">getStatus</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> mStatus; };</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  };</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> </div><div class="line"><a name="l00080"></a><span class="lineno"><a class="line" href="classam_1_1CAmNode.html"> 80</a></span>  <span class="keyword">template</span> <<span class="keyword">class</span> NodeData> <span class="keyword">class </span><a class="code" href="classam_1_1CAmNode.html">CAmNode</a> : <span class="keyword">public</span> <a class="code" href="classam_1_1CAmGraphElement.html">CAmGraphElement</a></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  {</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  uint16_t mIndex; </div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  NodeData mData; </div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00085"></a><span class="lineno"><a class="line" href="classam_1_1CAmNode.html#a4d03e831a99ce12c036d395defbcfb83"> 85</a></span>  <a class="code" href="classam_1_1CAmNode.html#a4d03e831a99ce12c036d395defbcfb83">CAmNode</a>(<span class="keyword">const</span> NodeData & in):<a class="code" href="classam_1_1CAmGraphElement.html">CAmGraphElement</a>(), mIndex(0), mData(in) { };</div><div class="line"><a name="l00086"></a><span class="lineno"><a class="line" href="classam_1_1CAmNode.html#a39bef722be27347ed1d62399ba718feb"> 86</a></span>  <a class="code" href="classam_1_1CAmNode.html#a39bef722be27347ed1d62399ba718feb">CAmNode</a>(<span class="keyword">const</span> NodeData & in, <span class="keyword">const</span> uint16_t index):<a class="code" href="classam_1_1CAmGraphElement.html">CAmGraphElement</a>(), mIndex(index), mData(in) { };</div><div class="line"><a name="l00087"></a><span class="lineno"><a class="line" href="classam_1_1CAmNode.html#ad19913578515c0445597dd67452ee3e9"> 87</a></span>  <a class="code" href="classam_1_1CAmNode.html#ad19913578515c0445597dd67452ee3e9">~CAmNode</a>() { };</div><div class="line"><a name="l00091"></a><span class="lineno"><a class="line" href="classam_1_1CAmNode.html#aa74cd25b5a14a4c0ad0284a6c33b24ba"> 91</a></span>  NodeData & <a class="code" href="classam_1_1CAmNode.html#aa74cd25b5a14a4c0ad0284a6c33b24ba">getData</a>() { <span class="keywordflow">return</span> mData; }</div><div class="line"><a name="l00092"></a><span class="lineno"><a class="line" href="classam_1_1CAmNode.html#aa605a7543d371e405d2c5bdbed3c9d98"> 92</a></span>  <span class="keyword">const</span> NodeData & <a class="code" href="classam_1_1CAmNode.html#aa605a7543d371e405d2c5bdbed3c9d98">getData</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> mData; }</div><div class="line"><a name="l00093"></a><span class="lineno"><a class="line" href="classam_1_1CAmNode.html#acfc2a38f7576b6f290ba861a94158eef"> 93</a></span>  uint16_t <a class="code" href="classam_1_1CAmNode.html#acfc2a38f7576b6f290ba861a94158eef">getIndex</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> mIndex; }</div><div class="line"><a name="l00094"></a><span class="lineno"><a class="line" href="classam_1_1CAmNode.html#ae1b72ca42747f5d9ee58e43a158bb2bd"> 94</a></span>  <span class="keywordtype">void</span> <a class="code" href="classam_1_1CAmNode.html#ae1b72ca42747f5d9ee58e43a158bb2bd">setIndex</a>(uint16_t index) { mIndex = index; }</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  };</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> </div><div class="line"><a name="l00097"></a><span class="lineno"><a class="line" href="classam_1_1CAmVertex.html"> 97</a></span>  <span class="keyword">template</span> <<span class="keyword">class</span> NodeData, <span class="keyword">class</span> VertexData> <span class="keyword">class </span><a class="code" href="classam_1_1CAmVertex.html">CAmVertex</a> : <span class="keyword">public</span> <a class="code" href="classam_1_1CAmGraphElement.html">CAmGraphElement</a></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  {</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <a class="code" href="classam_1_1CAmNode.html">CAmNode<NodeData></a>* mpNode; </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  VertexData mVertexData; </div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  uint16_t mWeight; </div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00103"></a><span class="lineno"><a class="line" href="classam_1_1CAmVertex.html#a3f5869d3946ce9fe03ae9c261b0a48ac"> 103</a></span>  <a class="code" href="classam_1_1CAmVertex.html#a3f5869d3946ce9fe03ae9c261b0a48ac">CAmVertex</a>(<a class="code" href="classam_1_1CAmNode.html">CAmNode<NodeData></a> *aNode, <span class="keyword">const</span> VertexData & vertexData, <span class="keyword">const</span> uint16_t weight):<a class="code" href="classam_1_1CAmGraphElement.html">CAmGraphElement</a>(),</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  mpNode(aNode), mVertexData(vertexData), mWeight(weight) { };</div><div class="line"><a name="l00105"></a><span class="lineno"><a class="line" href="classam_1_1CAmVertex.html#a9e27b1b94189e8f955892abc01b7ea0b"> 105</a></span>  <a class="code" href="classam_1_1CAmVertex.html#a9e27b1b94189e8f955892abc01b7ea0b">~CAmVertex</a>() { };</div><div class="line"><a name="l00109"></a><span class="lineno"><a class="line" href="classam_1_1CAmVertex.html#aa85b1f345da1f6423fc5df9ad241e4f3"> 109</a></span>  <a class="code" href="classam_1_1CAmNode.html">CAmNode<NodeData></a>* <a class="code" href="classam_1_1CAmVertex.html#aa85b1f345da1f6423fc5df9ad241e4f3">getNode</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> mpNode; }</div><div class="line"><a name="l00110"></a><span class="lineno"><a class="line" href="classam_1_1CAmVertex.html#a14146dc1aa5ce1c44d2acca230530573"> 110</a></span>  VertexData & <a class="code" href="classam_1_1CAmVertex.html#a14146dc1aa5ce1c44d2acca230530573">getData</a>() { <span class="keywordflow">return</span> mVertexData; }</div><div class="line"><a name="l00111"></a><span class="lineno"><a class="line" href="classam_1_1CAmVertex.html#a3c4b1b3cbd3ead815b400905b1ed4248"> 111</a></span>  uint16_t <a class="code" href="classam_1_1CAmVertex.html#a3c4b1b3cbd3ead815b400905b1ed4248">getWeight</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> mWeight; }</div><div class="line"><a name="l00112"></a><span class="lineno"><a class="line" href="classam_1_1CAmVertex.html#ae52161cdbd98204529dd0f1ad3e5ca9f"> 112</a></span>  <span class="keywordtype">void</span> <a class="code" href="classam_1_1CAmVertex.html#ae52161cdbd98204529dd0f1ad3e5ca9f">setWeight</a>(<span class="keyword">const</span> uint16_t weight) { mWeight=weight; }</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  };</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> </div><div class="line"><a name="l00119"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html"> 119</a></span>  <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> V> <span class="keyword">class </span><a class="code" href="classam_1_1CAmGraph.html">CAmGraph</a></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  {</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::vector<CAmNode<T>*> CAmListNodePtrs;</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::list<CAmVertex<T,V>> CAmListVertices;</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::list<CAmVertex<T,V>>::iterator CAmListVerticesItr;</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::list<CAmVertex<T,V>>::const_iterator CAmListVerticesItrConst;</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::list<CAmListVertices> CAmNodesAdjList;</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::list<CAmListVertices>::iterator CAmNodesAdjListItr;</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::list<CAmListVertices>::const_iterator CAmNodesAdjListItrConst;</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::list<CAmNode<T>> CAmListNodes;</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::list<CAmNode<T>>::iterator CAmListNodesItr;</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::list<CAmNode<T>>::const_iterator CAmListNodesItrConst;</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::vector<CAmNode<T>*> CAmNodeReferenceList;</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::vector<CAmListVertices*> CAmVertexReferenceList;</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> </div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  CAmListNodes mStoreNodes; </div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  CAmNodesAdjList mStoreAdjList; </div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  CAmNodeReferenceList mPointersNodes; </div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  CAmVertexReferenceList mPointersAdjList; </div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keywordtype">bool</span> mIsCyclic; </div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> </div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keyword">struct </span>IterateThroughAllNodesDelegate</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  {</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> * source;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> * destination;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  CAmNodeReferenceList visited;</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  std::function<bool(const CAmNode<T> * )> shouldVisitNode;</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  std::function<void(const CAmNode<T> *)> willVisitNode;</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  std::function<void(const CAmNode<T> *)> didVisitNode;</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  std::function<void(const CAmNodeReferenceList & path)> didFindPath;</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  };</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> </div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keyword">struct </span>VisitNodeDelegate</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  {</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> * source;</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> * destination;</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  std::function<void(const am_GraphPathPosition_e, CAmNode<T> &)> visitedNode;</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  };</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> </div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keywordtype">void</span> updateIndexes(<span class="keyword">const</span> int16_t fromIndex)</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  {</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordflow">if</span>( fromIndex<mPointersNodes.size() )</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  {</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordflow">for</span>(<span class="keyword">auto</span> iter = mPointersNodes.begin()+fromIndex; iter!=mPointersNodes.end(); iter++)</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  (*iter)-><a class="code" href="classam_1_1CAmNode.html#ae1b72ca42747f5d9ee58e43a158bb2bd">setIndex</a>(iter-mPointersNodes.begin());</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  }</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  }</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> </div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> </div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keyword">typedef</span> uint16_t vertex_t;</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keyword">typedef</span> uint16_t weight_t;</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> </div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordtype">void</span> findShortestPathsFromNode(<span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & node, std::vector<weight_t> &minDistance, std::vector<<a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> *> &previous)</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  {</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keyword">typename</span> CAmListVertices::const_iterator nIter;</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  CAmListVertices * neighbors;</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  weight_t dist, weight, v, distanceThroughU;</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a>* pU;</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <a class="code" href="classam_1_1CAmVertex.html">CAmVertex<T,V></a> * pVertex;</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> *pDstNode;</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> </div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordtype">size_t</span> n = mPointersAdjList.size();</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  std::set<std::pair<weight_t, CAmNode<T>*> > vertexQueue;</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> </div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  minDistance.clear();</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  minDistance.resize(n, std::numeric_limits<weight_t>::max());</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  minDistance[node.<a class="code" href="classam_1_1CAmNode.html#acfc2a38f7576b6f290ba861a94158eef">getIndex</a>()] = 0;</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  previous.clear();</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  previous.resize(n, NULL);</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> </div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  vertexQueue.insert(std::make_pair(minDistance[node.<a class="code" href="classam_1_1CAmNode.html#acfc2a38f7576b6f290ba861a94158eef">getIndex</a>()], (<a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a>*)&node));</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span> </div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordflow">while</span> (!vertexQueue.empty())</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  {</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  dist = vertexQueue.begin()->first;</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  pU = vertexQueue.begin()->second;</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  vertexQueue.erase(vertexQueue.begin());</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="comment">//todo: terminate the search at this position if you want the path to a target node ( if(pU==target)break; )</span></div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> </div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="comment">// Visit each edge exiting u</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  neighbors = mPointersAdjList[pU-><a class="code" href="classam_1_1CAmNode.html#acfc2a38f7576b6f290ba861a94158eef">getIndex</a>()];</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  nIter = neighbors->begin();</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordflow">for</span> (; nIter != neighbors->end(); nIter++)</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  {</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  pVertex = (<a class="code" href="classam_1_1CAmVertex.html">CAmVertex<T,V></a> *)&(*nIter);</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  pDstNode = pVertex-><a class="code" href="classam_1_1CAmVertex.html#aa85b1f345da1f6423fc5df9ad241e4f3">getNode</a>();</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> </div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  v = pDstNode-><a class="code" href="classam_1_1CAmNode.html#acfc2a38f7576b6f290ba861a94158eef">getIndex</a>();</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  weight = pVertex-><a class="code" href="classam_1_1CAmVertex.html#a3c4b1b3cbd3ead815b400905b1ed4248">getWeight</a>();</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  distanceThroughU = dist + weight;</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keywordflow">if</span> (distanceThroughU < minDistance[pDstNode-><a class="code" href="classam_1_1CAmNode.html#acfc2a38f7576b6f290ba861a94158eef">getIndex</a>()])</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  {</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  vertexQueue.erase(std::make_pair(minDistance[v], pDstNode));</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  minDistance[v] = distanceThroughU;</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  previous[v] = pU;</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  vertexQueue.insert(std::make_pair(minDistance[v], pDstNode));</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  }</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  }</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  }</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  }</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> </div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keywordtype">void</span> constructShortestPathTo(<span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & node, <span class="keyword">const</span> std::vector<<a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> *> &previous, CAmListNodePtrs & result)</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  {</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> * vertex = (<a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> *)&node;</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span> </div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordtype">int</span> i=0;</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keywordflow">while</span> ( (vertex = previous[vertex-><a class="code" href="classam_1_1CAmNode.html#acfc2a38f7576b6f290ba861a94158eef">getIndex</a>()])!=NULL )</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  {</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  result.insert(result.begin(), vertex);</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  i++;</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  }</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">if</span>(i)</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  result.push_back((<a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> *)&node);</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  }</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> </div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordtype">void</span> constructShortestPathTo(<span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & node, <span class="keyword">const</span> std::vector<<a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> *> &previous, std::function<<span class="keywordtype">void</span>(<span class="keyword">const</span> am_GraphPathPosition_e pos, <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> &)> cb)</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  {</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> * vertex = (<a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> *)&node;</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> * prev = vertex;</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordtype">int</span> i=0;</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keywordflow">while</span> ( (vertex = previous[vertex-><a class="code" href="classam_1_1CAmNode.html#acfc2a38f7576b6f290ba861a94158eef">getIndex</a>()])!=NULL )</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  {</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  cb(i==0?GRAPH_PATH_START:<a class="code" href="namespaceam.html#abb9b450360ced141aa4d58a18a2fdd8a">GRAPH_PATH_MIDDLE</a>, *prev);</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  prev = vertex;</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  i++;</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  }</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keywordflow">if</span>(i)</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  cb(GRAPH_PATH_END, *prev);</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  }</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span> </div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keywordtype">void</span> findAllPaths(IterateThroughAllNodesDelegate & delegate)</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  {</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  CAmListVertices * nodes = mPointersAdjList[delegate.visited.back()->getIndex()];</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  CAmListVerticesItrConst vItr(nodes->begin());</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span> </div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <a class="code" href="classam_1_1CAmVertex.html">CAmVertex<T,V></a> * pNextVertex;</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> * pNextNode;</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keywordflow">for</span> (; vItr != nodes->end(); ++vItr)</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  {</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  pNextVertex = (<a class="code" href="classam_1_1CAmVertex.html">CAmVertex<T,V></a> *)&(*vItr);</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  pNextNode = pNextVertex->getNode();</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keywordflow">if</span>(</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  pNextNode-><a class="code" href="classam_1_1CAmGraphElement.html#ab5f90ebf60b28be325744117caa28c7d">getStatus</a>()!=GES_NOT_VISITED ||</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  !delegate.shouldVisitNode(pNextNode)</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  )</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordflow">if</span> (pNextNode==delegate.destination)</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  {</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  delegate.willVisitNode(pNextNode);</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  pNextNode-><a class="code" href="classam_1_1CAmGraphElement.html#adfa42a6ab9f619fc459cf0c3b025f17d">setStatus</a>(<a class="code" href="namespaceam.html#aa5ba1f024fafe67c566a642b23493bfe">GES_IN_PROGRESS</a>);</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  delegate.visited.push_back(pNextNode);</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="comment">//notify observer</span></div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  delegate.didFindPath(delegate.visited);</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="comment">//remove last node from the list</span></div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keyword">auto</span> last = delegate.visited.end()-1;</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  delegate.visited.erase(last);</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  pNextNode-><a class="code" href="classam_1_1CAmGraphElement.html#adfa42a6ab9f619fc459cf0c3b025f17d">setStatus</a>(GES_NOT_VISITED);</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  delegate.didVisitNode(pNextNode);</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  }</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  }</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  vItr = nodes->begin();</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="comment">//bfs like loop</span></div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keywordflow">for</span> (; vItr != nodes->end(); ++vItr)</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  {</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  pNextVertex = (<a class="code" href="classam_1_1CAmVertex.html">CAmVertex<T,V></a> *)&(*vItr);</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  pNextNode = pNextVertex->getNode();</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span> </div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keywordflow">if</span>(pNextNode-><a class="code" href="classam_1_1CAmGraphElement.html#ab5f90ebf60b28be325744117caa28c7d">getStatus</a>()!=GES_NOT_VISITED ||</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  pNextNode==delegate.destination ||</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  !delegate.shouldVisitNode(pNextNode)</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  )</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  delegate.willVisitNode(pNextNode);</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  pNextNode-><a class="code" href="classam_1_1CAmGraphElement.html#adfa42a6ab9f619fc459cf0c3b025f17d">setStatus</a>(<a class="code" href="namespaceam.html#aa5ba1f024fafe67c566a642b23493bfe">GES_IN_PROGRESS</a>);</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  delegate.visited.push_back(pNextNode);</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  findAllPaths(delegate);</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="comment">//remove last node from the list</span></div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keyword">auto</span> last = delegate.visited.end()-1;</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  delegate.visited.erase(last);</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  pNextNode-><a class="code" href="classam_1_1CAmGraphElement.html#adfa42a6ab9f619fc459cf0c3b025f17d">setStatus</a>(GES_NOT_VISITED);</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  delegate.didVisitNode(pNextNode);</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  }</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  }</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span> </div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span> </div><div class="line"><a name="l00341"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#ad058b5fe86c6fc79e52e45412f407ba3"> 341</a></span>  <span class="keyword">explicit</span> <a class="code" href="classam_1_1CAmGraph.html#ad058b5fe86c6fc79e52e45412f407ba3">CAmGraph</a>(<span class="keyword">const</span> std::vector<T> &v):mStoreNodes(), mStoreAdjList(), mPointersNodes(), mPointersAdjList()</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  {</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::vector<T>::const_iterator inItr;</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  inItr itr(v.begin());</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span> </div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordflow">for</span> (; itr != v.end(); ++itr)</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  {</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  addNode(*itr);</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  }</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span> </div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  mIsCyclic = <span class="keyword">false</span>;</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  };</div><div class="line"><a name="l00353"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#aacfc7ecb1c6f9f2cfd68eef0d901164a"> 353</a></span>  <a class="code" href="classam_1_1CAmGraph.html#aacfc7ecb1c6f9f2cfd68eef0d901164a">CAmGraph</a>():mStoreNodes(), mStoreAdjList(), mPointersNodes(), mPointersAdjList(), mIsCyclic(false){};</div><div class="line"><a name="l00354"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#ab625d9c756925d076398e9cffdf9326a"> 354</a></span>  <a class="code" href="classam_1_1CAmGraph.html#ab625d9c756925d076398e9cffdf9326a">~CAmGraph</a>(){}</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span> </div><div class="line"><a name="l00356"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#abeffbe1d02adc086d48896c6afababea"> 356</a></span>  <span class="keyword">const</span> CAmListNodes & <a class="code" href="classam_1_1CAmGraph.html#abeffbe1d02adc086d48896c6afababea">getNodes</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keywordflow">return</span> mStoreNodes;</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  }</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span> </div><div class="line"><a name="l00361"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#ac9f19e90b4162c9958288e7633454937"> 361</a></span>  <span class="keyword">const</span> CAmVertexReferenceList & <a class="code" href="classam_1_1CAmGraph.html#ac9f19e90b4162c9958288e7633454937">getVertexList</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordflow">return</span> mPointersAdjList;</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  }</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span> </div><div class="line"><a name="l00370"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#af0e39bdae53e986e3ac7c389e4cf4a4e"> 370</a></span>  <span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a>* <a class="code" href="classam_1_1CAmGraph.html#af0e39bdae53e986e3ac7c389e4cf4a4e">findNode</a>(<span class="keyword">const</span> T & in)</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  {</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keyword">typename</span> CAmNodeReferenceList::const_iterator itr (mPointersNodes.begin());</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span> </div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keywordflow">for</span> (; itr != mPointersNodes.end(); ++itr)</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  {</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keywordflow">if</span> ((*itr)->getData() == in) {</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keywordflow">return</span> (*itr);</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  }</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  }</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keywordflow">return</span> NULL;</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  }</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> </div><div class="line"><a name="l00387"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#aa6d7ba3750918b17e245238c40d2aaa9"> 387</a></span>  <span class="keyword">const</span> <a class="code" href="classam_1_1CAmVertex.html">CAmVertex<T,V></a>* <a class="code" href="classam_1_1CAmGraph.html#aa6d7ba3750918b17e245238c40d2aaa9">findVertex</a>(<span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & edge1, <span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & edge2)<span class="keyword"> const</span></div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> * pEdge2 = (<a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> *)&edge2;</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keyword">const</span> CAmListVertices * list = mPointersAdjList[edge1.<a class="code" href="classam_1_1CAmNode.html#acfc2a38f7576b6f290ba861a94158eef">getIndex</a>()];</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  CAmListVerticesItrConst result = std::find_if(list->begin(), list->end(), [&](<span class="keyword">const</span> <a class="code" href="classam_1_1CAmVertex.html">CAmVertex<T,V></a> & refObject){</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keywordflow">return</span> refObject.getNode()==pEdge2;</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  });</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keywordflow">if</span>(result!=list->end())</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="keywordflow">return</span> (<a class="code" href="classam_1_1CAmVertex.html">CAmVertex<T,V></a>*)&(*result);</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span> </div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keywordflow">return</span> NULL;</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  }</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span> </div><div class="line"><a name="l00400"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#af9c9308d8e80e0981711ec8040e60a98"> 400</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classam_1_1CAmGraph.html#af9c9308d8e80e0981711ec8040e60a98">hasCycles</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keywordflow">return</span> mIsCyclic;</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  }</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span> </div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span> </div><div class="line"><a name="l00410"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#aac6081d0d2bae9c619b1e7f888f103d4"> 410</a></span>  <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & <a class="code" href="classam_1_1CAmGraph.html#aac6081d0d2bae9c619b1e7f888f103d4">addNode</a>(<span class="keyword">const</span> T & in)</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  {</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keywordtype">size_t</span> index = mStoreNodes.size();</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  mStoreNodes.emplace_back(in, index);</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  mStoreAdjList.emplace_back();</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  mPointersNodes.push_back(&mStoreNodes.back());</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  mPointersAdjList.push_back(&mStoreAdjList.back());</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keywordflow">return</span> mStoreNodes.back();</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  }</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span> </div><div class="line"><a name="l00423"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#a96cd60ecce64513f0ec6f1c89c2dd11d"> 423</a></span>  <span class="keywordtype">void</span> <a class="code" href="classam_1_1CAmGraph.html#a96cd60ecce64513f0ec6f1c89c2dd11d">removeVertex</a>(<span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & edge1, <span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & edge2)</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  {</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="keyword">const</span> CAmListVertices * list = mPointersAdjList[edge1.<a class="code" href="classam_1_1CAmNode.html#acfc2a38f7576b6f290ba861a94158eef">getIndex</a>()];</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  CAmListVerticesItr iter = std::find_if(list->begin(), list->end(), [&edge2](<span class="keyword">const</span> <a class="code" href="classam_1_1CAmVertex.html">CAmVertex<T,V></a> & refVertex){</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keywordflow">return</span> (refVertex.getNode()==&edge2);</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  });</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <span class="keywordflow">if</span>(iter!=list->end())</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  list->erase(iter);</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  }</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span> </div><div class="line"><a name="l00436"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#a4bc6c964235a6ea6fa83c4877b01b44c"> 436</a></span>  <span class="keywordtype">void</span> <a class="code" href="classam_1_1CAmGraph.html#a4bc6c964235a6ea6fa83c4877b01b44c">removeAllVerticesToNode</a>(<span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & node)</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  {</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keyword">auto</span> comparator = [&node](<span class="keyword">const</span> <a class="code" href="classam_1_1CAmVertex.html">CAmVertex<T,V></a> & refVertex){</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keywordflow">return</span> (refVertex.getNode()==&node);</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  };</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keyword">auto</span> itr = mPointersAdjList.begin();</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="keywordflow">for</span>(;itr!=mPointersAdjList.end();itr++)</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  {</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  CAmListVertices * vertices = *itr;</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keyword">auto</span> iterVert = std::find_if(vertices->begin(), vertices->end(), comparator);</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keywordflow">if</span>(iterVert!=vertices->end())</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  vertices->erase(iterVert);</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  }</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  }</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span> </div><div class="line"><a name="l00454"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#a81bc90ab3538cda18fd964243ef8f3ea"> 454</a></span>  <span class="keywordtype">void</span> <a class="code" href="classam_1_1CAmGraph.html#a81bc90ab3538cda18fd964243ef8f3ea">removeNode</a>(<span class="keyword">const</span> T & in)</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  {</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> * node = findNode(in);</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="keywordflow">if</span>(node!=NULL)</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  removeNode(*node);</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  }</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span> </div><div class="line"><a name="l00464"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#a212d9fcfab2cc5c0d3bd8cdd35b17e1f"> 464</a></span>  <span class="keywordtype">void</span> <a class="code" href="classam_1_1CAmGraph.html#a212d9fcfab2cc5c0d3bd8cdd35b17e1f">removeNode</a>(<span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & node)</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  {</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  uint16_t index = node.<a class="code" href="classam_1_1CAmNode.html#acfc2a38f7576b6f290ba861a94158eef">getIndex</a>();</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  removeAllVerticesToNode(node);</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  mPointersAdjList.erase(mPointersAdjList.begin()+index);</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  mPointersNodes.erase(mPointersNodes.begin()+index);</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keyword">auto</span> iter = std::find_if(mStoreNodes.begin(), mStoreNodes.end(), [&node](<span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & otherNode){</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keywordflow">return</span> &otherNode==&node;</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  });</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keywordflow">if</span>(iter!=mStoreNodes.end())</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  mStoreNodes.erase(iter);</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  updateIndexes(index);</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  }</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span> </div><div class="line"><a name="l00481"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#a54afa84a6cedb9558108352b551d4cf3"> 481</a></span>  <span class="keywordtype">void</span> <a class="code" href="classam_1_1CAmGraph.html#a54afa84a6cedb9558108352b551d4cf3">connectNodes</a>(<span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & first, <span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & last, <span class="keyword">const</span> V & vertexData, <span class="keyword">const</span> int16_t weight = 1)</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  {</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  CAmListVertices * list = mPointersAdjList[first.<a class="code" href="classam_1_1CAmNode.html#acfc2a38f7576b6f290ba861a94158eef">getIndex</a>()];</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> * node = mPointersNodes[last.<a class="code" href="classam_1_1CAmNode.html#acfc2a38f7576b6f290ba861a94158eef">getIndex</a>()];</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  list->emplace_back(node, vertexData, weight);</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  }</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span> </div><div class="line"><a name="l00492"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#a9b71f2fc0f5022d9d56b928a26366a81"> 492</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classam_1_1CAmGraph.html#a9b71f2fc0f5022d9d56b928a26366a81">isAnyVertex</a>(<span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & edge1, <span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & edge2)<span class="keyword"> const</span></div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="keywordflow">return</span> findVertex(edge1, edge2)!=NULL;</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  }</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span> </div><div class="line"><a name="l00500"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#a14e0e6b289e17384b884b5b19b03bb35"> 500</a></span>  <span class="keywordtype">void</span> <a class="code" href="classam_1_1CAmGraph.html#a14e0e6b289e17384b884b5b19b03bb35">reset</a>()</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  {</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="comment">// set all nodes to GES_NOT_VISITED</span></div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  std::for_each(mPointersNodes.begin(), mPointersNodes.end(), [](<a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> * refNode){</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="keywordflow">if</span>(refNode->getStatus()!= GES_NOT_VISITED)</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  refNode->setStatus(GES_NOT_VISITED);</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  });</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="comment">// set all vertices to GES_NOT_VISITED</span></div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keyword">auto</span> action = [](<a class="code" href="classam_1_1CAmVertex.html">CAmVertex<T,V></a> & refVertex){</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keywordflow">if</span>(refVertex.getStatus()!= GES_NOT_VISITED)</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  refVertex.setStatus(GES_NOT_VISITED);</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  };</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keyword">auto</span> itr1(mPointersAdjList.begin());</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keywordflow">for</span> (; itr1 != mPointersAdjList.end(); ++itr1)</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  {</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  CAmListVertices * vertices = *itr1;</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  std::for_each(vertices->begin(), vertices->end(), action);</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  }</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  }</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span> </div><div class="line"><a name="l00523"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#af25961b4c8868eb20fefd1315dc31e10"> 523</a></span>  <span class="keywordtype">void</span> <a class="code" href="classam_1_1CAmGraph.html#af25961b4c8868eb20fefd1315dc31e10">clear</a>()</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  {</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  mStoreNodes.clear();</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  mStoreAdjList.clear();</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  mPointersAdjList.clear();</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  mPointersNodes.clear();</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  mPointersAdjList.clear();</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  }</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span> </div><div class="line"><a name="l00535"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#a42029ecef5cb964679df6e36ad23f163"> 535</a></span>  <span class="keywordtype">void</span> <a class="code" href="classam_1_1CAmGraph.html#a42029ecef5cb964679df6e36ad23f163">trace</a>(std::function<<span class="keywordtype">void</span>(<span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> &, <span class="keyword">const</span> std::vector<<a class="code" href="classam_1_1CAmVertex.html">CAmVertex<T,V></a>*> &)> cb)</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  {</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  std::for_each(mPointersNodes.begin(), mPointersNodes.end(), [&](<a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> * refNode){</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  CAmListVertices * vertices = this->mPointersAdjList[refNode->getIndex()];</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  std::vector<CAmVertex<T,V>*> list;</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  std::for_each(vertices->begin(), vertices->end(), [&list](<a class="code" href="classam_1_1CAmVertex.html">CAmVertex<T,V></a> & refVertex){</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  list.push_back(&refVertex);</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  });</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  cb(*refNode, list);</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  });</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  }</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span> </div><div class="line"><a name="l00554"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#afbaea2860663d3266a7b4d25e5041b5d"> 554</a></span>  <span class="keywordtype">void</span> <a class="code" href="classam_1_1CAmGraph.html#afbaea2860663d3266a7b4d25e5041b5d">getShortestPath</a>(<span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & source, <span class="keyword">const</span> CAmListNodePtrs & listTargets, std::vector<CAmListNodePtrs> & resultPath )</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  {</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> numberOfNodes = mPointersNodes.size();</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keywordflow">if</span>(numberOfNodes==0)</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span> </div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  std::vector<weight_t> min_distance;</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  std::vector<CAmNode<T>*> previous;</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  findShortestPathsFromNode(source, min_distance, previous);</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span> </div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="keywordflow">for</span>(<span class="keyword">auto</span> it=listTargets.begin(); it!=listTargets.end(); it++)</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  {</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> *node = *it;</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  resultPath.emplace_back();</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  CAmListNodePtrs & path = resultPath.back();</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  constructShortestPathTo(*node, previous, path);</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="keywordflow">if</span>(path.empty())</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  {</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="keyword">typename</span> std::vector<CAmListNodePtrs>::iterator iter = resultPath.end();</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  resultPath.erase(--iter);</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  }</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  }</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  }</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span> </div><div class="line"><a name="l00585"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#a78ba788e4f24d0307375cf3d5f2e1add"> 585</a></span>  <span class="keywordtype">void</span> <a class="code" href="classam_1_1CAmGraph.html#a78ba788e4f24d0307375cf3d5f2e1add">getShortestPath</a>(<span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & source, <span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & destination, CAmListNodePtrs & resultPath )</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  {</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> numberOfNodes = mPointersNodes.size();</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="keywordflow">if</span>(numberOfNodes==0)</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  std::vector<weight_t> min_distance;</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  std::vector<CAmNode<T>*> previous;</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  findShortestPathsFromNode(source, min_distance, previous);</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  constructShortestPathTo(destination, previous, resultPath);</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  }</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span> </div><div class="line"><a name="l00604"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#a03e1c7f59afa4678e960eebf36a6c84f"> 604</a></span>  <span class="keywordtype">void</span> <a class="code" href="classam_1_1CAmGraph.html#a03e1c7f59afa4678e960eebf36a6c84f">getShortestPath</a>(<span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & source,</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <span class="keyword">const</span> CAmListNodePtrs & listTargets,</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  std::function<<span class="keywordtype">void</span>(<span class="keyword">const</span> am_GraphPathPosition_e, <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> &)> cb )</div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  {</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> numberOfNodes = mPointersNodes.size();</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="keywordflow">if</span>(numberOfNodes==0)</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span> </div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  std::vector<weight_t> min_distance;</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  std::vector<CAmNode<T>*> previous;</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  findShortestPathsFromNode(source, min_distance, previous);</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span> </div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="keywordflow">for</span>(<span class="keyword">auto</span> it=listTargets.begin(); it!=listTargets.end(); it++)</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  {</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a>* node = *it;</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  constructShortestPathTo(*node, previous, cb);</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  }</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  }</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span> </div><div class="line"><a name="l00631"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#a6a69f87f438eb1257aa8c2457e43ad4f"> 631</a></span>  <span class="keywordtype">void</span> <a class="code" href="classam_1_1CAmGraph.html#a6a69f87f438eb1257aa8c2457e43ad4f">getShortestPath</a>(<span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & source,</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & destination,</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  std::function<<span class="keywordtype">void</span>(<span class="keyword">const</span> am_GraphPathPosition_e, <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> &)> cb )</div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  {</div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> numberOfNodes = mPointersNodes.size();</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="keywordflow">if</span>(numberOfNodes==0)</div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span> </div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  std::vector<weight_t> min_distance;</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  std::vector<CAmNode<T>*> previous;</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  findShortestPathsFromNode(source, min_distance, previous);</div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  constructShortestPathTo(destination, previous, cb);</div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  }</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span> </div><div class="line"><a name="l00656"></a><span class="lineno"><a class="line" href="classam_1_1CAmGraph.html#a82af8323ee0df0fa83294e340ddac83a"> 656</a></span>  <span class="keywordtype">void</span> <a class="code" href="classam_1_1CAmGraph.html#a82af8323ee0df0fa83294e340ddac83a">getAllPaths</a>(<a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & src,</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> & dst,</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  std::function<<span class="keywordtype">bool</span>(<span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> * )> cbShouldVisitNode,</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  std::function<<span class="keywordtype">void</span>(<span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> *)> cbWillVisitNode,</div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  std::function<<span class="keywordtype">void</span>(<span class="keyword">const</span> <a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a> *)> cbDidVisitNode,</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  std::function<<span class="keywordtype">void</span>(<span class="keyword">const</span> CAmNodeReferenceList & path)> cbDidFindPath)</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  {</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  IterateThroughAllNodesDelegate delegate;</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  delegate.source = &src;</div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  delegate.destination = &dst;</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  delegate.shouldVisitNode = cbShouldVisitNode;</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  delegate.willVisitNode = cbWillVisitNode;</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  delegate.didVisitNode = cbDidVisitNode;</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  delegate.didFindPath = cbDidFindPath;</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  delegate.visited.push_back((<a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a>*)&src);</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  ((<a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a>*)&src)->setStatus(GES_VISITED);</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  findAllPaths(delegate);</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  ((<a class="code" href="classam_1_1CAmNode.html">CAmNode<T></a>*)&src)->setStatus(GES_NOT_VISITED);</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  }</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  };</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span> </div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span> }</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span> </div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span> <span class="preprocessor">#endif</span></div><div class="ttc" id="classam_1_1CAmNode_html_ad19913578515c0445597dd67452ee3e9"><div class="ttname"><a href="classam_1_1CAmNode.html#ad19913578515c0445597dd67452ee3e9">am::CAmNode::~CAmNode</a></div><div class="ttdeci">~CAmNode()</div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00087">CAmGraph.h:87</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_a212d9fcfab2cc5c0d3bd8cdd35b17e1f"><div class="ttname"><a href="classam_1_1CAmGraph.html#a212d9fcfab2cc5c0d3bd8cdd35b17e1f">am::CAmGraph::removeNode</a></div><div class="ttdeci">void removeNode(const CAmNode< T > &node)</div><div class="ttdoc">Removes the given node from the graph . </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00464">CAmGraph.h:464</a></div></div>
<div class="ttc" id="classam_1_1CAmVertex_html_ae52161cdbd98204529dd0f1ad3e5ca9f"><div class="ttname"><a href="classam_1_1CAmVertex.html#ae52161cdbd98204529dd0f1ad3e5ca9f">am::CAmVertex::setWeight</a></div><div class="ttdeci">void setWeight(const uint16_t weight)</div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00112">CAmGraph.h:112</a></div></div>
<div class="ttc" id="namespaceam_html"><div class="ttname"><a href="namespaceam.html">am</a></div><div class="ttdoc">A Common-API wrapper class, which loads the common-api runtime and instantiates all necessary objects...</div><div class="ttdef"><b>Definition:</b> <a href="CAmCommandReceiver_8h_source.html#l00029">CAmCommandReceiver.h:29</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_af0e39bdae53e986e3ac7c389e4cf4a4e"><div class="ttname"><a href="classam_1_1CAmGraph.html#af0e39bdae53e986e3ac7c389e4cf4a4e">am::CAmGraph::findNode</a></div><div class="ttdeci">const CAmNode< T > * findNode(const T &in)</div><div class="ttdoc">Returns pointer to a node which data is equal to the given. </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00370">CAmGraph.h:370</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_af9c9308d8e80e0981711ec8040e60a98"><div class="ttname"><a href="classam_1_1CAmGraph.html#af9c9308d8e80e0981711ec8040e60a98">am::CAmGraph::hasCycles</a></div><div class="ttdeci">bool hasCycles() const </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00400">CAmGraph.h:400</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_afbaea2860663d3266a7b4d25e5041b5d"><div class="ttname"><a href="classam_1_1CAmGraph.html#afbaea2860663d3266a7b4d25e5041b5d">am::CAmGraph::getShortestPath</a></div><div class="ttdeci">void getShortestPath(const CAmNode< T > &source, const CAmListNodePtrs &listTargets, std::vector< CAmListNodePtrs > &resultPath)</div><div class="ttdoc">Finds the shortest path from given node to all nodes in listTargets. </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00554">CAmGraph.h:554</a></div></div>
<div class="ttc" id="classam_1_1CAmVertex_html_a9e27b1b94189e8f955892abc01b7ea0b"><div class="ttname"><a href="classam_1_1CAmVertex.html#a9e27b1b94189e8f955892abc01b7ea0b">am::CAmVertex::~CAmVertex</a></div><div class="ttdeci">~CAmVertex()</div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00105">CAmGraph.h:105</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_a54afa84a6cedb9558108352b551d4cf3"><div class="ttname"><a href="classam_1_1CAmGraph.html#a54afa84a6cedb9558108352b551d4cf3">am::CAmGraph::connectNodes</a></div><div class="ttdeci">void connectNodes(const CAmNode< T > &first, const CAmNode< T > &last, const V &vertexData, const int16_t weight=1)</div><div class="ttdoc">Connect first with last node and set user data and weight to the vertex. </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00481">CAmGraph.h:481</a></div></div>
<div class="ttc" id="classam_1_1CAmNode_html_aa605a7543d371e405d2c5bdbed3c9d98"><div class="ttname"><a href="classam_1_1CAmNode.html#aa605a7543d371e405d2c5bdbed3c9d98">am::CAmNode::getData</a></div><div class="ttdeci">const NodeData & getData() const </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00092">CAmGraph.h:92</a></div></div>
<div class="ttc" id="classam_1_1CAmNode_html_aa74cd25b5a14a4c0ad0284a6c33b24ba"><div class="ttname"><a href="classam_1_1CAmNode.html#aa74cd25b5a14a4c0ad0284a6c33b24ba">am::CAmNode::getData</a></div><div class="ttdeci">NodeData & getData()</div><div class="ttdoc">Setters and getters. </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00091">CAmGraph.h:91</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_aa6d7ba3750918b17e245238c40d2aaa9"><div class="ttname"><a href="classam_1_1CAmGraph.html#aa6d7ba3750918b17e245238c40d2aaa9">am::CAmGraph::findVertex</a></div><div class="ttdeci">const CAmVertex< T, V > * findVertex(const CAmNode< T > &edge1, const CAmNode< T > &edge2) const </div><div class="ttdoc">Returns pointer to a vertex which two ends are equal to the given nodes. </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00387">CAmGraph.h:387</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_aac6081d0d2bae9c619b1e7f888f103d4"><div class="ttname"><a href="classam_1_1CAmGraph.html#aac6081d0d2bae9c619b1e7f888f103d4">am::CAmGraph::addNode</a></div><div class="ttdeci">CAmNode< T > & addNode(const T &in)</div><div class="ttdoc">Adds a new node to the graph with given user data. </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00410">CAmGraph.h:410</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html"><div class="ttname"><a href="classam_1_1CAmGraph.html">am::CAmGraph</a></div><div class="ttdoc">Class representing a directed or undirected graph. </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00119">CAmGraph.h:119</a></div></div>
<div class="ttc" id="classam_1_1CAmVertex_html_a3f5869d3946ce9fe03ae9c261b0a48ac"><div class="ttname"><a href="classam_1_1CAmVertex.html#a3f5869d3946ce9fe03ae9c261b0a48ac">am::CAmVertex::CAmVertex</a></div><div class="ttdeci">CAmVertex(CAmNode< NodeData > *aNode, const VertexData &vertexData, const uint16_t weight)</div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00103">CAmGraph.h:103</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_a9b71f2fc0f5022d9d56b928a26366a81"><div class="ttname"><a href="classam_1_1CAmGraph.html#a9b71f2fc0f5022d9d56b928a26366a81">am::CAmGraph::isAnyVertex</a></div><div class="ttdeci">bool isAnyVertex(const CAmNode< T > &edge1, const CAmNode< T > &edge2) const </div><div class="ttdoc">Exists any vertex with two given ends. </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00492">CAmGraph.h:492</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_ad058b5fe86c6fc79e52e45412f407ba3"><div class="ttname"><a href="classam_1_1CAmGraph.html#ad058b5fe86c6fc79e52e45412f407ba3">am::CAmGraph::CAmGraph</a></div><div class="ttdeci">CAmGraph(const std::vector< T > &v)</div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00341">CAmGraph.h:341</a></div></div>
<div class="ttc" id="classam_1_1CAmGraphElement_html_adfa42a6ab9f619fc459cf0c3b025f17d"><div class="ttname"><a href="classam_1_1CAmGraphElement.html#adfa42a6ab9f619fc459cf0c3b025f17d">am::CAmGraphElement::setStatus</a></div><div class="ttdeci">void setStatus(const am_GraphElementStatus_e s)</div><div class="ttdoc">Setter and getter. </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00076">CAmGraph.h:76</a></div></div>
<div class="ttc" id="classam_1_1CAmVertex_html_a14146dc1aa5ce1c44d2acca230530573"><div class="ttname"><a href="classam_1_1CAmVertex.html#a14146dc1aa5ce1c44d2acca230530573">am::CAmVertex::getData</a></div><div class="ttdeci">VertexData & getData()</div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00110">CAmGraph.h:110</a></div></div>
<div class="ttc" id="classam_1_1CAmVertex_html_aa85b1f345da1f6423fc5df9ad241e4f3"><div class="ttname"><a href="classam_1_1CAmVertex.html#aa85b1f345da1f6423fc5df9ad241e4f3">am::CAmVertex::getNode</a></div><div class="ttdeci">CAmNode< NodeData > * getNode() const </div><div class="ttdoc">Setters and getters. </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00109">CAmGraph.h:109</a></div></div>
<div class="ttc" id="namespaceam_html_aa5ba1f024fafe67c566a642b23493bfe"><div class="ttname"><a href="namespaceam.html#aa5ba1f024fafe67c566a642b23493bfe">am::GES_IN_PROGRESS</a></div><div class="ttdeci">typedef GES_IN_PROGRESS</div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00048">CAmGraph.h:48</a></div></div>
<div class="ttc" id="namespaceam_html_a5ddc1de5c77502d9fd136f30a5ebbd7c"><div class="ttname"><a href="namespaceam.html#a5ddc1de5c77502d9fd136f30a5ebbd7c">am::am_GraphPathPosition_e</a></div><div class="ttdeci">GRAPH_PATH_END am_GraphPathPosition_e</div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00058">CAmGraph.h:58</a></div></div>
<div class="ttc" id="classam_1_1CAmGraphElement_html_ab5f90ebf60b28be325744117caa28c7d"><div class="ttname"><a href="classam_1_1CAmGraphElement.html#ab5f90ebf60b28be325744117caa28c7d">am::CAmGraphElement::getStatus</a></div><div class="ttdeci">am_GraphElementStatus_e getStatus() const </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00077">CAmGraph.h:77</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_aacfc7ecb1c6f9f2cfd68eef0d901164a"><div class="ttname"><a href="classam_1_1CAmGraph.html#aacfc7ecb1c6f9f2cfd68eef0d901164a">am::CAmGraph::CAmGraph</a></div><div class="ttdeci">CAmGraph()</div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00353">CAmGraph.h:353</a></div></div>
<div class="ttc" id="classam_1_1CAmVertex_html"><div class="ttname"><a href="classam_1_1CAmVertex.html">am::CAmVertex</a></div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00097">CAmGraph.h:97</a></div></div>
<div class="ttc" id="namespaceam_html_ac85eb9c3b3735f8eea02a45482ce4943"><div class="ttname"><a href="namespaceam.html#ac85eb9c3b3735f8eea02a45482ce4943">am::am_GraphElementStatus_e</a></div><div class="ttdeci">GES_VISITED am_GraphElementStatus_e</div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00048">CAmGraph.h:48</a></div></div>
<div class="ttc" id="classam_1_1CAmGraphElement_html_ad42b8df4de1c9aca747f406f28ceb03e"><div class="ttname"><a href="classam_1_1CAmGraphElement.html#ad42b8df4de1c9aca747f406f28ceb03e">am::CAmGraphElement::~CAmGraphElement</a></div><div class="ttdeci">~CAmGraphElement()</div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00072">CAmGraph.h:72</a></div></div>
<div class="ttc" id="classam_1_1CAmNode_html_a4d03e831a99ce12c036d395defbcfb83"><div class="ttname"><a href="classam_1_1CAmNode.html#a4d03e831a99ce12c036d395defbcfb83">am::CAmNode::CAmNode</a></div><div class="ttdeci">CAmNode(const NodeData &in)</div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00085">CAmGraph.h:85</a></div></div>
<div class="ttc" id="classam_1_1CAmGraphElement_html"><div class="ttname"><a href="classam_1_1CAmGraphElement.html">am::CAmGraphElement</a></div><div class="ttdoc">This class is base class for nodes and vertices. </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00067">CAmGraph.h:67</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_a42029ecef5cb964679df6e36ad23f163"><div class="ttname"><a href="classam_1_1CAmGraph.html#a42029ecef5cb964679df6e36ad23f163">am::CAmGraph::trace</a></div><div class="ttdeci">void trace(std::function< void(const CAmNode< T > &, const std::vector< CAmVertex< T, V > * > &)> cb)</div><div class="ttdoc">Goes through all nodes and vertices and calls the callback. </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00535">CAmGraph.h:535</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_a03e1c7f59afa4678e960eebf36a6c84f"><div class="ttname"><a href="classam_1_1CAmGraph.html#a03e1c7f59afa4678e960eebf36a6c84f">am::CAmGraph::getShortestPath</a></div><div class="ttdeci">void getShortestPath(const CAmNode< T > &source, const CAmListNodePtrs &listTargets, std::function< void(const am_GraphPathPosition_e, CAmNode< T > &)> cb)</div><div class="ttdoc">Finds the shortest path from given node to all nodes in listTargets. </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00604">CAmGraph.h:604</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_abeffbe1d02adc086d48896c6afababea"><div class="ttname"><a href="classam_1_1CAmGraph.html#abeffbe1d02adc086d48896c6afababea">am::CAmGraph::getNodes</a></div><div class="ttdeci">const CAmListNodes & getNodes() const </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00356">CAmGraph.h:356</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_a6a69f87f438eb1257aa8c2457e43ad4f"><div class="ttname"><a href="classam_1_1CAmGraph.html#a6a69f87f438eb1257aa8c2457e43ad4f">am::CAmGraph::getShortestPath</a></div><div class="ttdeci">void getShortestPath(const CAmNode< T > &source, const CAmNode< T > &destination, std::function< void(const am_GraphPathPosition_e, CAmNode< T > &)> cb)</div><div class="ttdoc">Finds the shortest path between two given nodes. </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00631">CAmGraph.h:631</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_ab625d9c756925d076398e9cffdf9326a"><div class="ttname"><a href="classam_1_1CAmGraph.html#ab625d9c756925d076398e9cffdf9326a">am::CAmGraph::~CAmGraph</a></div><div class="ttdeci">~CAmGraph()</div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00354">CAmGraph.h:354</a></div></div>
<div class="ttc" id="namespaceam_html_abb9b450360ced141aa4d58a18a2fdd8a"><div class="ttname"><a href="namespaceam.html#abb9b450360ced141aa4d58a18a2fdd8a">am::GRAPH_PATH_MIDDLE</a></div><div class="ttdeci">typedef GRAPH_PATH_MIDDLE</div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00058">CAmGraph.h:58</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_af25961b4c8868eb20fefd1315dc31e10"><div class="ttname"><a href="classam_1_1CAmGraph.html#af25961b4c8868eb20fefd1315dc31e10">am::CAmGraph::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdoc">Clears all nodes and vertices. </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00523">CAmGraph.h:523</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_a14e0e6b289e17384b884b5b19b03bb35"><div class="ttname"><a href="classam_1_1CAmGraph.html#a14e0e6b289e17384b884b5b19b03bb35">am::CAmGraph::reset</a></div><div class="ttdeci">void reset()</div><div class="ttdoc">Sets the status of all nodes and vertices to GES_NOT_VISITED. </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00500">CAmGraph.h:500</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_a81bc90ab3538cda18fd964243ef8f3ea"><div class="ttname"><a href="classam_1_1CAmGraph.html#a81bc90ab3538cda18fd964243ef8f3ea">am::CAmGraph::removeNode</a></div><div class="ttdeci">void removeNode(const T &in)</div><div class="ttdoc">Removes a node with given user data . </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00454">CAmGraph.h:454</a></div></div>
<div class="ttc" id="classam_1_1CAmNode_html_acfc2a38f7576b6f290ba861a94158eef"><div class="ttname"><a href="classam_1_1CAmNode.html#acfc2a38f7576b6f290ba861a94158eef">am::CAmNode::getIndex</a></div><div class="ttdeci">uint16_t getIndex() const </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00093">CAmGraph.h:93</a></div></div>
<div class="ttc" id="classam_1_1CAmNode_html"><div class="ttname"><a href="classam_1_1CAmNode.html">am::CAmNode</a></div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00080">CAmGraph.h:80</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_a82af8323ee0df0fa83294e340ddac83a"><div class="ttname"><a href="classam_1_1CAmGraph.html#a82af8323ee0df0fa83294e340ddac83a">am::CAmGraph::getAllPaths</a></div><div class="ttdeci">void getAllPaths(CAmNode< T > &src, CAmNode< T > &dst, std::function< bool(const CAmNode< T > *)> cbShouldVisitNode, std::function< void(const CAmNode< T > *)> cbWillVisitNode, std::function< void(const CAmNode< T > *)> cbDidVisitNode, std::function< void(const CAmNodeReferenceList &path)> cbDidFindPath)</div><div class="ttdoc">Finds all possible paths between two given nodes. </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00656">CAmGraph.h:656</a></div></div>
<div class="ttc" id="classam_1_1CAmVertex_html_a3c4b1b3cbd3ead815b400905b1ed4248"><div class="ttname"><a href="classam_1_1CAmVertex.html#a3c4b1b3cbd3ead815b400905b1ed4248">am::CAmVertex::getWeight</a></div><div class="ttdeci">uint16_t getWeight() const </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00111">CAmGraph.h:111</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_a78ba788e4f24d0307375cf3d5f2e1add"><div class="ttname"><a href="classam_1_1CAmGraph.html#a78ba788e4f24d0307375cf3d5f2e1add">am::CAmGraph::getShortestPath</a></div><div class="ttdeci">void getShortestPath(const CAmNode< T > &source, const CAmNode< T > &destination, CAmListNodePtrs &resultPath)</div><div class="ttdoc">Finds the shortest path between two nodes. </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00585">CAmGraph.h:585</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_ac9f19e90b4162c9958288e7633454937"><div class="ttname"><a href="classam_1_1CAmGraph.html#ac9f19e90b4162c9958288e7633454937">am::CAmGraph::getVertexList</a></div><div class="ttdeci">const CAmVertexReferenceList & getVertexList() const </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00361">CAmGraph.h:361</a></div></div>
<div class="ttc" id="classam_1_1CAmGraphElement_html_a2186720c61aa5768c28e29658c4eb898"><div class="ttname"><a href="classam_1_1CAmGraphElement.html#a2186720c61aa5768c28e29658c4eb898">am::CAmGraphElement::CAmGraphElement</a></div><div class="ttdeci">CAmGraphElement()</div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00071">CAmGraph.h:71</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_a96cd60ecce64513f0ec6f1c89c2dd11d"><div class="ttname"><a href="classam_1_1CAmGraph.html#a96cd60ecce64513f0ec6f1c89c2dd11d">am::CAmGraph::removeVertex</a></div><div class="ttdeci">void removeVertex(const CAmNode< T > &edge1, const CAmNode< T > &edge2)</div><div class="ttdoc">Removes a vertex with two ends equal to the given nodes . </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00423">CAmGraph.h:423</a></div></div>
<div class="ttc" id="classam_1_1CAmGraph_html_a4bc6c964235a6ea6fa83c4877b01b44c"><div class="ttname"><a href="classam_1_1CAmGraph.html#a4bc6c964235a6ea6fa83c4877b01b44c">am::CAmGraph::removeAllVerticesToNode</a></div><div class="ttdeci">void removeAllVerticesToNode(const CAmNode< T > &node)</div><div class="ttdoc">Removes all vertices to given node . </div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00436">CAmGraph.h:436</a></div></div>
<div class="ttc" id="classam_1_1CAmNode_html_ae1b72ca42747f5d9ee58e43a158bb2bd"><div class="ttname"><a href="classam_1_1CAmNode.html#ae1b72ca42747f5d9ee58e43a158bb2bd">am::CAmNode::setIndex</a></div><div class="ttdeci">void setIndex(uint16_t index)</div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00094">CAmGraph.h:94</a></div></div>
<div class="ttc" id="classam_1_1CAmNode_html_a39bef722be27347ed1d62399ba718feb"><div class="ttname"><a href="classam_1_1CAmNode.html#a39bef722be27347ed1d62399ba718feb">am::CAmNode::CAmNode</a></div><div class="ttdeci">CAmNode(const NodeData &in, const uint16_t index)</div><div class="ttdef"><b>Definition:</b> <a href="CAmGraph_8h_source.html#l00086">CAmGraph.h:86</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_73840c26962c025d9d91b16130beda5a.html">AudioManagerCore</a></li><li class="navelem"><a class="el" href="dir_a2790e911832141e38a92850240f8218.html">include</a></li><li class="navelem"><a class="el" href="CAmGraph_8h.html">CAmGraph.h</a></li>
<li class="footer">Generated on Fri Feb 9 2018 14:50:29 for AudioManager by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.11 </li>
</ul>
</div>
</body>
</html>
|
