a00020.html 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475
  1. <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
  2. <html>
  3. <head>
  4. <meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
  5. <title>GTL - Graph Template Library: node Class Reference</title>
  6. <link href="doxygen.css" rel="stylesheet" type="text/css">
  7. </head>
  8. <body>
  9. <p class="links">
  10. <a href="../index.html">Home</a> |
  11. Documentation |
  12. <a href="../register.html">Download</a> |
  13. <a href="../platforms.html">Platforms</a> |
  14. <a href="../refer.html">Projects</a> |
  15. <a href="../lists.html">Mailing Lists</a> |
  16. <a href="../history.html">Version History</a>
  17. </p>
  18. <!-- Generated by Doxygen 1.5.3 -->
  19. <div class="tabs">
  20. <ul>
  21. <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
  22. <li class="current"><a href="classes.html"><span>Classes</span></a></li>
  23. <li><a href="files.html"><span>Files</span></a></li>
  24. <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
  25. </ul>
  26. </div>
  27. <div class="tabs">
  28. <ul>
  29. <li><a href="classes.html"><span>Alphabetical&nbsp;List</span></a></li>
  30. <li><a href="annotated.html"><span>Class&nbsp;List</span></a></li>
  31. <li><a href="hierarchy.html"><span>Class&nbsp;Hierarchy</span></a></li>
  32. <li><a href="functions.html"><span>Class&nbsp;Members</span></a></li>
  33. </ul>
  34. </div>
  35. <h1>node Class Reference</h1><!-- doxytag: class="node" -->A <a class="el" href="a00020.html" title="A node in a graph.">node</a> in a <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a>.
  36. <a href="#_details">More...</a>
  37. <p>
  38. <div class="dynheader">
  39. Collaboration diagram for node:</div>
  40. <div class="dynsection">
  41. <p><center><img src="a00177.gif" border="0" usemap="#a00178" alt="Collaboration graph"></center>
  42. <map name="a00178">
  43. <area shape="rect" title="int_node" alt="" coords="53,5,61,13"><area shape="rect" title="int_node" alt="" coords="53,24,61,32"></map>
  44. <center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>
  45. <p>
  46. <a href="a00179.html">List of all members.</a><table border="0" cellpadding="0" cellspacing="0">
  47. <tr><td></td></tr>
  48. <tr><td colspan="2"><br><h2>Public Member Functions</h2></td></tr>
  49. <tr><td class="memItemLeft" nowrap align="right" valign="top">&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00020.html#82669b7358b50bd8d7888d7df4ff8dfa">node</a> ()</td></tr>
  50. <tr><td class="memItemLeft" nowrap align="right" valign="top">int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00020.html#865fb0f86c522be2ed471f7e6bf2cd72">degree</a> () const </td></tr>
  51. <tr><td class="memItemLeft" nowrap align="right" valign="top">int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00020.html#faeabb676462c9c783268580e0346308">outdeg</a> () const </td></tr>
  52. <tr><td class="memItemLeft" nowrap align="right" valign="top">int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00020.html#572306615483cdb92b3bbd64929662f6">indeg</a> () const </td></tr>
  53. <tr><td class="memItemLeft" nowrap align="right" valign="top">const <a class="el" href="a00020.html">node</a> &amp;&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00020.html#f3c6d83261cbca46465367882bd8d82a">opposite</a> (<a class="el" href="a00010.html">edge</a> e) const </td></tr>
  54. <tr><td class="memItemLeft" nowrap align="right" valign="top">bool&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00020.html#3b99faf3a3b0d276779ecaee20dc1958">is_hidden</a> () const </td></tr>
  55. <tr><td class="memItemLeft" nowrap align="right" valign="top">int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00020.html#76dd179b0b9837b789f4d83aeeb2256c">excentricity</a> () const </td></tr>
  56. <tr><td class="memItemLeft" nowrap align="right" valign="top">adj_nodes_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00020.html#9888b8b82c07004d312118db5faed2a3">adj_nodes_begin</a> () const </td></tr>
  57. <tr><td class="memItemLeft" nowrap align="right" valign="top">adj_nodes_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00020.html#75ccc034a6dbec34b3b6040ca83b5c0d">adj_nodes_end</a> () const </td></tr>
  58. <tr><td class="memItemLeft" nowrap align="right" valign="top">adj_edges_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00020.html#3261a65141fbdb83fc43dae39096c266">adj_edges_begin</a> () const </td></tr>
  59. <tr><td class="memItemLeft" nowrap align="right" valign="top">adj_edges_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00020.html#9e0e440572dbf1a8922490d4fb0ad492">adj_edges_end</a> () const </td></tr>
  60. <tr><td class="memItemLeft" nowrap align="right" valign="top">in_edges_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00020.html#c41a2f299c0476d172219fde4166fb46">in_edges_begin</a> () const </td></tr>
  61. <tr><td class="memItemLeft" nowrap align="right" valign="top">in_edges_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00020.html#05cbc2b40fe6236e0747cde72307c219">in_edges_end</a> () const </td></tr>
  62. <tr><td class="memItemLeft" nowrap align="right" valign="top">out_edges_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00020.html#c489061d4e0ce37ea53883b8ada5e36c">out_edges_begin</a> () const </td></tr>
  63. <tr><td class="memItemLeft" nowrap align="right" valign="top">out_edges_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00020.html#8ad4727d15ec233b96095c7b864f5dc8">out_edges_end</a> () const </td></tr>
  64. <tr><td class="memItemLeft" nowrap align="right" valign="top">inout_edges_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00020.html#17171329e4cb1b386f5216b80702b94e">inout_edges_begin</a> () const </td></tr>
  65. <tr><td class="memItemLeft" nowrap align="right" valign="top">inout_edges_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00020.html#9278d751206d4977b6de6f1a4fb72bb7">inout_edges_end</a> () const </td></tr>
  66. <tr><td colspan="2"><br><h2>Friends</h2></td></tr>
  67. <tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="b8b0dbc1b36724e5e4635ac651c218cb"></a><!-- doxytag: member="node::graph" ref="b8b0dbc1b36724e5e4635ac651c218cb" args="" -->
  68. class&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00020.html#b8b0dbc1b36724e5e4635ac651c218cb">graph</a></td></tr>
  69. <tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="534891c80172dde5e777a3908cc6e2f1"></a><!-- doxytag: member="node::edge" ref="534891c80172dde5e777a3908cc6e2f1" args="" -->
  70. class&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00020.html#534891c80172dde5e777a3908cc6e2f1">edge</a></td></tr>
  71. </table>
  72. <hr><a name="_details"></a><h2>Detailed Description</h2>
  73. A <a class="el" href="a00020.html" title="A node in a graph.">node</a> in a <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a>.
  74. <p>
  75. Iterator for adjacent nodes of a <a class="el" href="a00020.html" title="A node in a graph.">node</a>.<p>
  76. Iterator for all incident edges of a <a class="el" href="a00020.html" title="A node in a graph.">node</a>.<p>
  77. Iterator for adjacent edges of a <a class="el" href="a00020.html" title="A node in a graph.">node</a>. <hr><h2>Constructor &amp; Destructor Documentation</h2>
  78. <a class="anchor" name="82669b7358b50bd8d7888d7df4ff8dfa"></a><!-- doxytag: member="node::node" ref="82669b7358b50bd8d7888d7df4ff8dfa" args="()" -->
  79. <div class="memitem">
  80. <div class="memproto">
  81. <table class="memname">
  82. <tr>
  83. <td class="memname">node::node </td>
  84. <td>(</td>
  85. <td class="paramname"> </td>
  86. <td>&nbsp;)&nbsp;</td>
  87. <td width="100%"></td>
  88. </tr>
  89. </table>
  90. </div>
  91. <div class="memdoc">
  92. <p>
  93. Default constructor. Creates an invalid <a class="el" href="a00020.html" title="A node in a graph.">node</a>. The only way to obtain a valid <a class="el" href="a00020.html" title="A node in a graph.">node</a> is through <a class="el" href="a00014.html#8dfd63c0fde7f4b552d9e3b319b5854b">graph::new_node</a> Example: <pre>
  94. <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> g;
  95. <a class="el" href="a00020.html" title="A node in a graph.">node</a> n;</pre><p>
  96. <pre> n = g.new_node();
  97. </pre><p>
  98. <dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00014.html#8dfd63c0fde7f4b552d9e3b319b5854b">graph::new_node</a> </dd></dl>
  99. </div>
  100. </div><p>
  101. <hr><h2>Member Function Documentation</h2>
  102. <a class="anchor" name="865fb0f86c522be2ed471f7e6bf2cd72"></a><!-- doxytag: member="node::degree" ref="865fb0f86c522be2ed471f7e6bf2cd72" args="() const " -->
  103. <div class="memitem">
  104. <div class="memproto">
  105. <table class="memname">
  106. <tr>
  107. <td class="memname">int node::degree </td>
  108. <td>(</td>
  109. <td class="paramname"> </td>
  110. <td>&nbsp;)&nbsp;</td>
  111. <td width="100%"> const</td>
  112. </tr>
  113. </table>
  114. </div>
  115. <div class="memdoc">
  116. <p>
  117. Returns the degree of the <a class="el" href="a00020.html" title="A node in a graph.">node</a>, i. e. <a class="el" href="a00020.html#faeabb676462c9c783268580e0346308">node::outdeg</a> + <a class="el" href="a00020.html#572306615483cdb92b3bbd64929662f6">node::indeg</a> .
  118. </div>
  119. </div><p>
  120. <a class="anchor" name="faeabb676462c9c783268580e0346308"></a><!-- doxytag: member="node::outdeg" ref="faeabb676462c9c783268580e0346308" args="() const " -->
  121. <div class="memitem">
  122. <div class="memproto">
  123. <table class="memname">
  124. <tr>
  125. <td class="memname">int node::outdeg </td>
  126. <td>(</td>
  127. <td class="paramname"> </td>
  128. <td>&nbsp;)&nbsp;</td>
  129. <td width="100%"> const</td>
  130. </tr>
  131. </table>
  132. </div>
  133. <div class="memdoc">
  134. <p>
  135. Returns the out degree of the <a class="el" href="a00020.html" title="A node in a graph.">node</a>, i. e. the number of outgoing edges.
  136. </div>
  137. </div><p>
  138. <a class="anchor" name="572306615483cdb92b3bbd64929662f6"></a><!-- doxytag: member="node::indeg" ref="572306615483cdb92b3bbd64929662f6" args="() const " -->
  139. <div class="memitem">
  140. <div class="memproto">
  141. <table class="memname">
  142. <tr>
  143. <td class="memname">int node::indeg </td>
  144. <td>(</td>
  145. <td class="paramname"> </td>
  146. <td>&nbsp;)&nbsp;</td>
  147. <td width="100%"> const</td>
  148. </tr>
  149. </table>
  150. </div>
  151. <div class="memdoc">
  152. <p>
  153. Returns the in degree of the <a class="el" href="a00020.html" title="A node in a graph.">node</a>, i. e. the number of incoming edges.
  154. </div>
  155. </div><p>
  156. <a class="anchor" name="f3c6d83261cbca46465367882bd8d82a"></a><!-- doxytag: member="node::opposite" ref="f3c6d83261cbca46465367882bd8d82a" args="(edge e) const " -->
  157. <div class="memitem">
  158. <div class="memproto">
  159. <table class="memname">
  160. <tr>
  161. <td class="memname">const <a class="el" href="a00020.html">node</a>&amp; node::opposite </td>
  162. <td>(</td>
  163. <td class="paramtype"><a class="el" href="a00010.html">edge</a>&nbsp;</td>
  164. <td class="paramname"> <em>e</em> </td>
  165. <td>&nbsp;)&nbsp;</td>
  166. <td width="100%"> const</td>
  167. </tr>
  168. </table>
  169. </div>
  170. <div class="memdoc">
  171. <p>
  172. Returns the <a class="el" href="a00020.html" title="A node in a graph.">node</a> on the opposite side of <code>e</code>.<p>
  173. <dl compact><dt><b>Parameters:</b></dt><dd>
  174. <table border="0" cellspacing="2" cellpadding="0">
  175. <tr><td valign="top"></td><td valign="top"><em>e</em>&nbsp;</td><td>an <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> incident to the <a class="el" href="a00020.html" title="A node in a graph.">node</a> </td></tr>
  176. </table>
  177. </dl>
  178. </div>
  179. </div><p>
  180. <a class="anchor" name="3b99faf3a3b0d276779ecaee20dc1958"></a><!-- doxytag: member="node::is_hidden" ref="3b99faf3a3b0d276779ecaee20dc1958" args="() const " -->
  181. <div class="memitem">
  182. <div class="memproto">
  183. <table class="memname">
  184. <tr>
  185. <td class="memname">bool node::is_hidden </td>
  186. <td>(</td>
  187. <td class="paramname"> </td>
  188. <td>&nbsp;)&nbsp;</td>
  189. <td width="100%"> const</td>
  190. </tr>
  191. </table>
  192. </div>
  193. <div class="memdoc">
  194. <p>
  195. Returns true iff <a class="el" href="a00020.html" title="A node in a graph.">node</a> is hidden.<p>
  196. <dl class="return" compact><dt><b>Returns:</b></dt><dd>true iff <a class="el" href="a00020.html" title="A node in a graph.">node</a> is hidden. </dd></dl>
  197. <dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00014.html#b2f8520bcac080d73c55228fecc61825">graph::hide_edge</a> <p>
  198. <a class="el" href="a00014.html#2e5426682a0897b9f9104b019970bedc">graph::restore_edge</a> </dd></dl>
  199. </div>
  200. </div><p>
  201. <a class="anchor" name="76dd179b0b9837b789f4d83aeeb2256c"></a><!-- doxytag: member="node::excentricity" ref="76dd179b0b9837b789f4d83aeeb2256c" args="() const " -->
  202. <div class="memitem">
  203. <div class="memproto">
  204. <table class="memname">
  205. <tr>
  206. <td class="memname">int node::excentricity </td>
  207. <td>(</td>
  208. <td class="paramname"> </td>
  209. <td>&nbsp;)&nbsp;</td>
  210. <td width="100%"> const</td>
  211. </tr>
  212. </table>
  213. </div>
  214. <div class="memdoc">
  215. <p>
  216. Returns the excentricity of the <a class="el" href="a00020.html" title="A node in a graph.">node</a>, i.e. the maximum graph-theoretic distance to another <a class="el" href="a00020.html" title="A node in a graph.">node</a><p>
  217. <dl class="return" compact><dt><b>Returns:</b></dt><dd>excentricity of <a class="el" href="a00020.html" title="A node in a graph.">node</a>. </dd></dl>
  218. </div>
  219. </div><p>
  220. <a class="anchor" name="9888b8b82c07004d312118db5faed2a3"></a><!-- doxytag: member="node::adj_nodes_begin" ref="9888b8b82c07004d312118db5faed2a3" args="() const " -->
  221. <div class="memitem">
  222. <div class="memproto">
  223. <table class="memname">
  224. <tr>
  225. <td class="memname">adj_nodes_iterator node::adj_nodes_begin </td>
  226. <td>(</td>
  227. <td class="paramname"> </td>
  228. <td>&nbsp;)&nbsp;</td>
  229. <td width="100%"> const</td>
  230. </tr>
  231. </table>
  232. </div>
  233. <div class="memdoc">
  234. <p>
  235. Iterate through all adjacent nodes.<p>
  236. <dl class="return" compact><dt><b>Returns:</b></dt><dd>start for iteration through all adjacent nodes </dd></dl>
  237. </div>
  238. </div><p>
  239. <a class="anchor" name="75ccc034a6dbec34b3b6040ca83b5c0d"></a><!-- doxytag: member="node::adj_nodes_end" ref="75ccc034a6dbec34b3b6040ca83b5c0d" args="() const " -->
  240. <div class="memitem">
  241. <div class="memproto">
  242. <table class="memname">
  243. <tr>
  244. <td class="memname">adj_nodes_iterator node::adj_nodes_end </td>
  245. <td>(</td>
  246. <td class="paramname"> </td>
  247. <td>&nbsp;)&nbsp;</td>
  248. <td width="100%"> const</td>
  249. </tr>
  250. </table>
  251. </div>
  252. <div class="memdoc">
  253. <p>
  254. Iterate through all adjacent nodes.<p>
  255. <dl class="return" compact><dt><b>Returns:</b></dt><dd>end for iteration through all adjacent nodes </dd></dl>
  256. </div>
  257. </div><p>
  258. <a class="anchor" name="3261a65141fbdb83fc43dae39096c266"></a><!-- doxytag: member="node::adj_edges_begin" ref="3261a65141fbdb83fc43dae39096c266" args="() const " -->
  259. <div class="memitem">
  260. <div class="memproto">
  261. <table class="memname">
  262. <tr>
  263. <td class="memname">adj_edges_iterator node::adj_edges_begin </td>
  264. <td>(</td>
  265. <td class="paramname"> </td>
  266. <td>&nbsp;)&nbsp;</td>
  267. <td width="100%"> const</td>
  268. </tr>
  269. </table>
  270. </div>
  271. <div class="memdoc">
  272. <p>
  273. Iterate through all adjacent edges.<p>
  274. <dl class="return" compact><dt><b>Returns:</b></dt><dd>start for iteration through all adjacent edges </dd></dl>
  275. </div>
  276. </div><p>
  277. <a class="anchor" name="9e0e440572dbf1a8922490d4fb0ad492"></a><!-- doxytag: member="node::adj_edges_end" ref="9e0e440572dbf1a8922490d4fb0ad492" args="() const " -->
  278. <div class="memitem">
  279. <div class="memproto">
  280. <table class="memname">
  281. <tr>
  282. <td class="memname">adj_edges_iterator node::adj_edges_end </td>
  283. <td>(</td>
  284. <td class="paramname"> </td>
  285. <td>&nbsp;)&nbsp;</td>
  286. <td width="100%"> const</td>
  287. </tr>
  288. </table>
  289. </div>
  290. <div class="memdoc">
  291. <p>
  292. Iterate through all adjacent edges.<p>
  293. <dl class="return" compact><dt><b>Returns:</b></dt><dd>end for iteration through all adjacent edges </dd></dl>
  294. </div>
  295. </div><p>
  296. <a class="anchor" name="c41a2f299c0476d172219fde4166fb46"></a><!-- doxytag: member="node::in_edges_begin" ref="c41a2f299c0476d172219fde4166fb46" args="() const " -->
  297. <div class="memitem">
  298. <div class="memproto">
  299. <table class="memname">
  300. <tr>
  301. <td class="memname">in_edges_iterator node::in_edges_begin </td>
  302. <td>(</td>
  303. <td class="paramname"> </td>
  304. <td>&nbsp;)&nbsp;</td>
  305. <td width="100%"> const</td>
  306. </tr>
  307. </table>
  308. </div>
  309. <div class="memdoc">
  310. <p>
  311. Iterate through all incoming edges.<p>
  312. <dl class="return" compact><dt><b>Returns:</b></dt><dd>start for iteration through all incoming edges </dd></dl>
  313. </div>
  314. </div><p>
  315. <a class="anchor" name="05cbc2b40fe6236e0747cde72307c219"></a><!-- doxytag: member="node::in_edges_end" ref="05cbc2b40fe6236e0747cde72307c219" args="() const " -->
  316. <div class="memitem">
  317. <div class="memproto">
  318. <table class="memname">
  319. <tr>
  320. <td class="memname">in_edges_iterator node::in_edges_end </td>
  321. <td>(</td>
  322. <td class="paramname"> </td>
  323. <td>&nbsp;)&nbsp;</td>
  324. <td width="100%"> const</td>
  325. </tr>
  326. </table>
  327. </div>
  328. <div class="memdoc">
  329. <p>
  330. Iterate through all incoming edges.<p>
  331. <dl class="return" compact><dt><b>Returns:</b></dt><dd>end for iteration through all incoming edges </dd></dl>
  332. </div>
  333. </div><p>
  334. <a class="anchor" name="c489061d4e0ce37ea53883b8ada5e36c"></a><!-- doxytag: member="node::out_edges_begin" ref="c489061d4e0ce37ea53883b8ada5e36c" args="() const " -->
  335. <div class="memitem">
  336. <div class="memproto">
  337. <table class="memname">
  338. <tr>
  339. <td class="memname">out_edges_iterator node::out_edges_begin </td>
  340. <td>(</td>
  341. <td class="paramname"> </td>
  342. <td>&nbsp;)&nbsp;</td>
  343. <td width="100%"> const</td>
  344. </tr>
  345. </table>
  346. </div>
  347. <div class="memdoc">
  348. <p>
  349. Iterate through all outgoing edges.<p>
  350. <dl class="return" compact><dt><b>Returns:</b></dt><dd>start for iteration through all outgoing edges </dd></dl>
  351. </div>
  352. </div><p>
  353. <a class="anchor" name="8ad4727d15ec233b96095c7b864f5dc8"></a><!-- doxytag: member="node::out_edges_end" ref="8ad4727d15ec233b96095c7b864f5dc8" args="() const " -->
  354. <div class="memitem">
  355. <div class="memproto">
  356. <table class="memname">
  357. <tr>
  358. <td class="memname">out_edges_iterator node::out_edges_end </td>
  359. <td>(</td>
  360. <td class="paramname"> </td>
  361. <td>&nbsp;)&nbsp;</td>
  362. <td width="100%"> const</td>
  363. </tr>
  364. </table>
  365. </div>
  366. <div class="memdoc">
  367. <p>
  368. Iterate through all outgoing edges.<p>
  369. <dl class="return" compact><dt><b>Returns:</b></dt><dd>end for iteration through all outgoing edges </dd></dl>
  370. </div>
  371. </div><p>
  372. <a class="anchor" name="17171329e4cb1b386f5216b80702b94e"></a><!-- doxytag: member="node::inout_edges_begin" ref="17171329e4cb1b386f5216b80702b94e" args="() const " -->
  373. <div class="memitem">
  374. <div class="memproto">
  375. <table class="memname">
  376. <tr>
  377. <td class="memname">inout_edges_iterator node::inout_edges_begin </td>
  378. <td>(</td>
  379. <td class="paramname"> </td>
  380. <td>&nbsp;)&nbsp;</td>
  381. <td width="100%"> const</td>
  382. </tr>
  383. </table>
  384. </div>
  385. <div class="memdoc">
  386. <p>
  387. Iterate through all incoming <em>and</em> outgoing edges.<p>
  388. <dl class="return" compact><dt><b>Returns:</b></dt><dd>start for iteration through all incoming and outgoing edges </dd></dl>
  389. </div>
  390. </div><p>
  391. <a class="anchor" name="9278d751206d4977b6de6f1a4fb72bb7"></a><!-- doxytag: member="node::inout_edges_end" ref="9278d751206d4977b6de6f1a4fb72bb7" args="() const " -->
  392. <div class="memitem">
  393. <div class="memproto">
  394. <table class="memname">
  395. <tr>
  396. <td class="memname">inout_edges_iterator node::inout_edges_end </td>
  397. <td>(</td>
  398. <td class="paramname"> </td>
  399. <td>&nbsp;)&nbsp;</td>
  400. <td width="100%"> const</td>
  401. </tr>
  402. </table>
  403. </div>
  404. <div class="memdoc">
  405. <p>
  406. Iterate through all incoming <em>and</em> outgoing edges.<p>
  407. <dl class="return" compact><dt><b>Returns:</b></dt><dd>end for iteration through all incoming and outgoing edges </dd></dl>
  408. </div>
  409. </div><p>
  410. <p class="links">
  411. <a href="http://www.uni-passau.de/">University of Passau</a>
  412. &nbsp;-&nbsp;
  413. <a href="http://www.fmi.uni-passau.de/">FMI</a>
  414. &nbsp;-&nbsp;
  415. <a href="http://www.fmi.uni-passau.de/fmi/lehrstuehle/brandenburg/">Theoretical
  416. Computer Science</a>
  417. </p>
  418. <div class="copyright">
  419. Design &copy; 2002, 2003 <a href="mailto:raitner@fmi.uni-passau.de">Marcus Raitner</a>, University of Passau
  420. </div>
  421. </body>
  422. </html>