classpattern.html

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

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="45e1bba8f536825bc7909b1a56b59199"></a><!-- doxytag: member="pattern::operator&lt;" ref="45e1bba8f536825bc7909b1a56b59199" args="(const pattern&lt; PATTERN_PROPS, MINING_PROPS, ST, CC, ALLOC &gt; rhs) const " -->
bool&nbsp;</td><td class="memItemRight" valign="bottom"><b>operator&lt;</b> (const <a class="el" href="classpattern.html">pattern</a>&lt; PATTERN_PROPS, MINING_PROPS, ST, CC, ALLOC &gt; rhs) const </td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="6b61effc66f5f6ec1313f8d77cac4103"></a><!-- doxytag: member="pattern::set_support" ref="6b61effc66f5f6ec1313f8d77cac4103" args="(const pattern_support&lt; MINING_PROPS &gt; *const &amp;pat_sup)" -->
void&nbsp;</td><td class="memItemRight" valign="bottom"><b>set_support</b> (const <a class="el" href="classpattern__support.html">pattern_support</a>&lt; MINING_PROPS &gt; *const &amp;pat_sup)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpattern.html#93f1532b84b16da807a4e1386b95dcbc">set_sup</a> (const pair&lt; int, int &gt; &amp;s)</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Set the support for the pattern. Note: Should be only used for level-1 patterns.  <a href="#93f1532b84b16da807a4e1386b95dcbc"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="cb2d8590853bc6723d17e3d95045f735"></a><!-- doxytag: member="pattern::is_freq" ref="cb2d8590853bc6723d17e3d95045f735" args="(int min_sup)" -->
bool&nbsp;</td><td class="memItemRight" valign="bottom"><b>is_freq</b> (int min_sup)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="b06afad4aea2e0cd0e61d21afdf09937"></a><!-- doxytag: member="pattern::is_valid" ref="b06afad4aea2e0cd0e61d21afdf09937" args="(const int &amp;ms) const " -->
bool&nbsp;</td><td class="memItemRight" valign="bottom"><b>is_valid</b> (const int &amp;ms) const </td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpattern.html#b7c9f6193c9eccef49f6ce8fcc837661">init_canonical_code</a> (const CC_INIT_TYPE &amp;cc)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="ba6d3ce21d6e1e2ac8094b7994063f1a"></a><!-- doxytag: member="pattern::rmost_path" ref="ba6d3ce21d6e1e2ac8094b7994063f1a" args="() const " -->
const RMP_T &amp;&nbsp;</td><td class="memItemRight" valign="bottom"><b>rmost_path</b> () const </td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="8abfc44c2c362bf8334b694e05391264"></a><!-- doxytag: member="pattern::update_rmpath" ref="8abfc44c2c362bf8334b694e05391264" args="(int val)" -->
void&nbsp;</td><td class="memItemRight" valign="bottom"><b>update_rmpath</b> (int val)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="7204593774d3b8e3ccaf8937547288ea"></a><!-- doxytag: member="pattern::canonical_code" ref="7204593774d3b8e3ccaf8937547288ea" args="() const " -->
const CAN_CODE &amp;&nbsp;</td><td class="memItemRight" valign="bottom"><b>canonical_code</b> () const </td></tr>

<tr><td colspan="2"><br><h2>Public Attributes</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="d5eafd22562c013704eb561e4f865d7b"></a><!-- doxytag: member="pattern::_pat_sup" ref="d5eafd22562c013704eb561e4f865d7b" args="" -->
<a class="el" href="classpattern__support.html">pattern_support</a>&lt; MINING_PROPS &gt;&nbsp;</td><td class="memItemRight" valign="bottom"><b>_pat_sup</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="f7c96c02881cf620fd15246480f6b87f"></a><!-- doxytag: member="pattern::operator&lt;&lt;" ref="f7c96c02881cf620fd15246480f6b87f" args="(ostream &amp;, const pattern&lt; PATTERN_PROPS, MINING_PROPS, ST, CC, ALLOC &gt; *)" -->
ostream &amp;&nbsp;</td><td class="memItemRight" valign="bottom"><b>operator&lt;&lt;</b> (ostream &amp;, const <a class="el" href="classpattern.html">pattern</a>&lt; PATTERN_PROPS, MINING_PROPS, ST, CC, ALLOC &gt; *)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="0bf9e59f3e984736f037032ae33f8e31"></a><!-- doxytag: member="pattern::check_isomorphism" ref="0bf9e59f3e984736f037032ae33f8e31" args="(PATTERN *const &amp;pat)" -->
bool&nbsp;</td><td class="memItemRight" valign="bottom"><b>check_isomorphism</b> (<a class="el" href="classpattern.html">PATTERN</a> *const &amp;pat)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="2930f255b49d4f31a98c3dff6cc6cefc"></a><!-- doxytag: member="pattern::update_rmost_path" ref="2930f255b49d4f31a98c3dff6cc6cefc" args="(pattern&lt; PATTERN_PROPS, MINING_PROPS, ST, CC, ALLOC &gt; *const &amp;)" -->
void&nbsp;</td><td class="memItemRight" valign="bottom"><b>update_rmost_path</b> (<a class="el" href="classpattern.html">pattern</a>&lt; PATTERN_PROPS, MINING_PROPS, ST, CC, ALLOC &gt; *const &amp;)</td></tr>

</table>
<hr><a name="_details"></a><h2>Detailed Description</h2>
<h3>template&lt;class PATTERN_PROPS, class MINING_PROPS, class ST, template&lt; class, typename, typename, template&lt; typename &gt; class &gt; class CC, template&lt; typename &gt; class ALLOC = std::allocator&gt;<br>
 class pattern&lt; PATTERN_PROPS, MINING_PROPS, ST, CC, ALLOC &gt;</h3>

The Pattern Class. 
<p>
Pattern Class takes 4 template arguments. PATTERN_PROPS is the pattern property, MINING_PROPS is the mining property, ST is the pattern storage data structure, CC is the canonical code class. 
<p>
<hr><h2>Member Function Documentation</h2>
<a class="anchor" name="40590cc9a4598df65983f7716aa3c7fa"></a><!-- doxytag: member="pattern::add_in_edge" ref="40590cc9a4598df65983f7716aa3c7fa" args="(const int &amp;dest, const int &amp;src, const EDGE_T &amp;e)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class PATTERN_PROPS, class MINING_PROPS, class ST, template&lt; class, typename, typename, template&lt; typename &gt; class &gt; class CC, template&lt; typename &gt; class ALLOC = std::allocator&gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="classpattern.html">pattern</a>&lt; PATTERN_PROPS, MINING_PROPS, ST, CC, ALLOC &gt;::add_in_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">const int &amp;&nbsp;</td>
          <td class="paramname"> <em>src</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const 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%"><code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Adds edge to in-edge list of dest Both vertices are required to be already part of the graph This function should be invoked for digraphs ONLY 
</div>
</div><p>
<a class="anchor" name="ac5dd176b16659ebd9fc665a1a77eea2"></a><!-- doxytag: member="pattern::add_out_edge" ref="ac5dd176b16659ebd9fc665a1a77eea2" args="(const int &amp;src, const int &amp;dest, const EDGE_T &amp;e)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class PATTERN_PROPS, class MINING_PROPS, class ST, template&lt; class, typename, typename, template&lt; typename &gt; class &gt; class CC, template&lt; typename &gt; class ALLOC = std::allocator&gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="classpattern.html">pattern</a>&lt; PATTERN_PROPS, MINING_PROPS, ST, CC, ALLOC &gt;::add_out_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">const int &amp;&nbsp;</td>
          <td class="paramname"> <em>dest</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const 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%"><code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Adds an edge to out-edge list of src Both vertices are required to be already part of the graph 
</div>
</div><p>
<a class="anchor" name="a7a0c9e586643031469f44d15ead5d37"></a><!-- doxytag: member="pattern::add_vertex" ref="a7a0c9e586643031469f44d15ead5d37" args="(const VERTEX_T &amp;v)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class PATTERN_PROPS, class MINING_PROPS, class ST, template&lt; class, typename, typename, template&lt; typename &gt; class &gt; class CC, template&lt; typename &gt; class ALLOC = std::allocator&gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">int <a class="el" href="classpattern.html">pattern</a>&lt; PATTERN_PROPS, MINING_PROPS, ST, CC, ALLOC &gt;::add_vertex           </td>
          <td>(</td>
          <td class="paramtype">const VERTEX_T &amp;&nbsp;</td>
          <td class="paramname"> <em>v</em>          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Adds vertex and makes it the right most vertex