classvat_3_01graph__prop_00_01v__fk1__mine__prop_00_01alloc_00_01st_01_4.html
来自「这是一个用于数据挖掘的常用算法的模板库(数据挖掘的C++模板库for UNIX)」· HTML 代码 · 共 323 行 · 第 1/2 页
HTML
323 行
</table><hr><a name="_details"></a><h2>Detailed Description</h2><h3>template<typename PP, typename MP, template< typename > class ALLOC, template< typename, typename > class ST><br> class vat< GRAPH_PROP, V_Fk1_MINE_PROP, ALLOC, ST ></h3>Graph VAT class by partial specialization of the generic VAT class. <p>In this partial specialization, PP is fixed to undirected (undirected graph property), MP is fixed to Fk X F1 and vert_mine (vertical mining with FK X F1), ST is the VAT storage type. For graph, ST should model a vector, else this shall not compile. <p><hr><h2>Member Typedef Documentation</h2><a class="anchor" name="a7791a2ed8c66de000e607d83f541c6b"></a><!-- doxytag: member="vat< GRAPH_PROP, V_Fk1_MINE_PROP, ALLOC, ST >::GVAT" ref="a7791a2ed8c66de000e607d83f541c6b" args="" --><div class="memitem"><div class="memproto"><div class="memtemplate">template<typename PP, typename MP, template< typename > class ALLOC, template< typename, typename > class ST> </div> <table class="memname"> <tr> <td class="memname">typedef ST<pair<int, RMP_VATS>, ALLOC<pair<int, RMP_VATS> > > <a class="el" href="classvat.html">vat</a>< GRAPH_PROP, V_Fk1_MINE_PROP, ALLOC, ST >::<a class="el" href="classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ALLOC_00_01ST_01_4.html#a7791a2ed8c66de000e607d83f541c6b">GVAT</a> </td> </tr> </table></div><div class="memdoc"><p>a graph-vat is a collection of evats for each vertex, where each evat must have same size. This collection of evats is organized itself as ST<EVAT> evats, and it holds evats of all edges on right most path of cand_pat </div></div><p><a class="anchor" name="ff0176a2b4ec69537f5dcb9e50c82318"></a><!-- doxytag: member="vat< GRAPH_PROP, V_Fk1_MINE_PROP, ALLOC, ST >::VSET" ref="ff0176a2b4ec69537f5dcb9e50c82318" args="" --><div class="memitem"><div class="memproto"><div class="memtemplate">template<typename PP, typename MP, template< typename > class ALLOC, template< typename, typename > class ST> </div> <table class="memname"> <tr> <td class="memname">typedef HASHNS::hash_set<int, HASHNS::hash<int>, std::equal_to<int>, ALLOC<int> > <a class="el" href="classvat.html">vat</a>< GRAPH_PROP, V_Fk1_MINE_PROP, ALLOC, ST >::<a class="el" href="classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ALLOC_00_01ST_01_4.html#ff0176a2b4ec69537f5dcb9e50c82318">VSET</a> </td> </tr> </table></div><div class="memdoc"><p>Set of vertex ids denoting exactly one of this graph's occurence in the dataset </div></div><p><a class="anchor" name="526a66d42ea4aab941d30c8bf37e6c16"></a><!-- doxytag: member="vat< GRAPH_PROP, V_Fk1_MINE_PROP, ALLOC, ST >::VSETS" ref="526a66d42ea4aab941d30c8bf37e6c16" args="" --><div class="memitem"><div class="memproto"><div class="memtemplate">template<typename PP, typename MP, template< typename > class ALLOC, template< typename, typename > class ST> </div> <table class="memname"> <tr> <td class="memname">typedef vector<vector<<a class="el" href="classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ALLOC_00_01ST_01_4.html#ff0176a2b4ec69537f5dcb9e50c82318">VSET</a>, ALLOC<<a class="el" href="classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ALLOC_00_01ST_01_4.html#ff0176a2b4ec69537f5dcb9e50c82318">VSET</a>> >, ALLOC<vector<<a class="el" href="classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ALLOC_00_01ST_01_4.html#ff0176a2b4ec69537f5dcb9e50c82318">VSET</a>, ALLOC<<a class="el" href="classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ALLOC_00_01ST_01_4.html#ff0176a2b4ec69537f5dcb9e50c82318">VSET</a>> > > > <a class="el" href="classvat.html">vat</a>< GRAPH_PROP, V_Fk1_MINE_PROP, ALLOC, ST >::<a class="el" href="classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ALLOC_00_01ST_01_4.html#526a66d42ea4aab941d30c8bf37e6c16">VSETS</a> </td> </tr> </table></div><div class="memdoc"><p>This graph can occur several times in one graph in the dataset, and in several graphs (tids) as well </div></div><p><hr><h2>Member Function Documentation</h2><a class="anchor" name="867248a3e91c6b8d64b30fd3e5988ef7"></a><!-- doxytag: member="vat< GRAPH_PROP, V_Fk1_MINE_PROP, ALLOC, ST >::intersection" ref="867248a3e91c6b8d64b30fd3e5988ef7" args="(const VAT *v1, const VAT *v2, PAT_SUP **cand_sups, PATTERN **cand_pats, bool)" --><div class="memitem"><div class="memproto"><div class="memtemplate">template<typename PP, typename MP, template< typename > class ALLOC, template< typename, typename > class ST> </div><div class="memtemplate">template<typename PATTERN, typename PAT_SUP> </div> <table class="memname"> <tr> <td class="memname">static <a class="el" href="classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ALLOC_00_01ST_01_4.html">VAT</a>** <a class="el" href="classvat.html">vat</a>< GRAPH_PROP, V_Fk1_MINE_PROP, ALLOC, ST >::intersection </td> <td>(</td> <td class="paramtype">const <a class="el" href="classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ALLOC_00_01ST_01_4.html">VAT</a> * </td> <td class="paramname"> <em>v1</em>, </td> </tr> <tr> <td class="paramkey"></td> <td></td> <td class="paramtype">const <a class="el" href="classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ALLOC_00_01ST_01_4.html">VAT</a> * </td> <td class="paramname"> <em>v2</em>, </td> </tr> <tr> <td class="paramkey"></td> <td></td> <td class="paramtype">PAT_SUP ** </td> <td class="paramname"> <em>cand_sups</em>, </td> </tr> <tr> <td class="paramkey"></td> <td></td> <td class="paramtype">PATTERN ** </td> <td class="paramname"> <em>cand_pats</em>, </td> </tr> <tr> <td class="paramkey"></td> <td></td> <td class="paramtype">bool </td> <td class="paramname"></td><td> </td> </tr> <tr> <td></td> <td>)</td> <td></td><td></td><td width="100%"><code> [inline, static]</code></td> </tr> </table></div><div class="memdoc"><p>Main vat intersection function; It also populates support argument passed <p>now determine the index of edge_vid on rmp of candidate. This is used by back_intersect.<p>we now have both evats, intersect them /// </div></div><p><a class="anchor" name="18c4caa2a2d7fa6f171367a35c9ebe52"></a><!-- doxytag: member="vat< GRAPH_PROP, V_Fk1_MINE_PROP, ALLOC, ST >::is_new_vertex" ref="18c4caa2a2d7fa6f171367a35c9ebe52" args="(const int &vid, const int &tid, const int &offset) const " --><div class="memitem"><div class="memproto"><div class="memtemplate">template<typename PP, typename MP, template< typename > class ALLOC, template< typename, typename > class ST> </div> <table class="memname"> <tr> <td class="memname">bool <a class="el" href="classvat.html">vat</a>< GRAPH_PROP, V_Fk1_MINE_PROP, ALLOC, ST >::is_new_vertex </td> <td>(</td> <td class="paramtype">const int & </td> <td class="paramname"> <em>vid</em>, </td> </tr> <tr> <td class="paramkey"></td> <td></td> <td class="paramtype">const int & </td> <td class="paramname"> <em>tid</em>, </td> </tr> <tr> <td class="paramkey"></td> <td></td> <td class="paramtype">const int & </td> <td class="paramname"> <em>offset</em></td><td> </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 vid occurs in any of the offset-th vids in tid-th vat </div></div><p><hr>The documentation for this class was generated from the following file:<ul><li><a class="el" href="graph__vat_8h-source.html">graph_vat.h</a></ul><hr size="1"><address style="align: right;"><small>Generated on Wed Jul 26 14:01:09 2006 for DMTL by <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>
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?