structvertex__info.html

这是一个用于数据挖掘的常用算法的模板库（数据挖掘的C++模板库for UNIX)

VERTEX_T&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="structvertex__info.html#487be5ba6c64222a987df9935b35a7e3">v</a></td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">data members /// <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="ddfcde9d01238e5e202cd1f155f3ba93"></a><!-- doxytag: member="vertex_info::id" ref="ddfcde9d01238e5e202cd1f155f3ba93" args="" -->
int&nbsp;</td><td class="memItemRight" valign="bottom"><b>id</b></td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="456a80e68ff3333597c6ac1c5bd909b0"></a><!-- doxytag: member="vertex_info::out_edges" ref="456a80e68ff3333597c6ac1c5bd909b0" args="" -->
EDGES&nbsp;</td><td class="memItemRight" valign="bottom"><b>out_edges</b></td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="d3aed6ffadea4fbbbc5782b48671505a"></a><!-- doxytag: member="vertex_info::in_edges" ref="d3aed6ffadea4fbbbc5782b48671505a" args="" -->
EDGES&nbsp;</td><td class="memItemRight" valign="bottom"><b>in_edges</b></td></tr>

<tr><td colspan="2"><br><h2>Friends</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="96b9fa301169d90525cce553f22cc965"></a><!-- doxytag: member="vertex_info::operator&lt;&lt;" ref="96b9fa301169d90525cce553f22cc965" args="(ostream &amp;, const vertex_info&lt; VERTEX_T, EDGE_T, ALLOC &gt; &amp;)" -->
ostream &amp;&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="structvertex__info.html#96b9fa301169d90525cce553f22cc965">operator&lt;&lt;</a> (ostream &amp;, const <a class="el" href="structvertex__info.html">vertex_info</a>&lt; VERTEX_T, EDGE_T, ALLOC &gt; &amp;)</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Outputs a <a class="el" href="structvertex__info.html">vertex_info</a> object to the stream. This is a global function, not a member function. <br></td></tr>
</table>
<hr><a name="_details"></a><h2>Detailed Description</h2>
<h3>template&lt;typename VERTEX_T, typename EDGE_T, template&lt; typename &gt; class ALLOC = std::allocator&gt;<br>
 struct vertex_info&lt; VERTEX_T, EDGE_T, ALLOC &gt;</h3>

class to store all info associated with a vertex. 
<p>
<hr><h2>Member Function Documentation</h2>
<a class="anchor" name="6257bc363dd9b634b969cd80b521e428"></a><!-- doxytag: member="vertex_info::in_edge" ref="6257bc363dd9b634b969cd80b521e428" args="(const int &amp;src, EDGE_T &amp;e) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename VERTEX_T, typename EDGE_T, template&lt; typename &gt; class ALLOC = std::allocator&gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">bool <a class="el" href="structvertex__info.html">vertex_info</a>&lt; VERTEX_T, EDGE_T, ALLOC &gt;::in_edge           </td>
          <td>(</td>
          <td class="paramtype">const int &amp;&nbsp;</td>
          <td class="paramname"> <em>src</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">EDGE_T &amp;&nbsp;</td>
          <td class="paramname"> <em>e</em></td><td>&nbsp;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td><td width="100%"> const<code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns true if there exists an in-edge from src to this vertex and populates edge label in e 
</div>
</div><p>
<a class="anchor" name="e7b64741f0cd85da0dd2117c4ee2e13e"></a><!-- doxytag: member="vertex_info::out_edge" ref="e7b64741f0cd85da0dd2117c4ee2e13e" args="(const int &amp;dest, EDGE_T &amp;e) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename VERTEX_T, typename EDGE_T, template&lt; typename &gt; class ALLOC = std::allocator&gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">bool <a class="el" href="structvertex__info.html">vertex_info</a>&lt; VERTEX_T, EDGE_T, ALLOC &gt;::out_edge           </td>
          <td>(</td>
          <td class="paramtype">const int &amp;&nbsp;</td>
          <td class="paramname"> <em>dest</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">EDGE_T &amp;&nbsp;</td>
          <td class="paramname"> <em>e</em></td><td>&nbsp;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td><td width="100%"> const<code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns true if there exists an out-edge from this vertex to dest and populates edge label in e 
</div>
</div><p>
<hr>The documentation for this struct was generated from the following file:<ul>
<li><a class="el" href="adj__list_8h-source.html">adj_list.h</a></ul>
<hr size="1"><address style="align: right;"><small>Generated on Wed Jul 26 14:01:09 2006 for DMTL by&nbsp;
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.7 </small></address>
</body>
</html>