📄 graph__cand__gen_8h-source.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"><title>DMTL: graph_cand_gen.h Source File</title><link href="doxygen.css" rel="stylesheet" type="text/css"><link href="tabs.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.4.7 --><div class="tabs"> <ul> <li><a href="index.html"><span>Main Page</span></a></li> <li><a href="annotated.html"><span>Classes</span></a></li> <li id="current"><a href="files.html"><span>Files</span></a></li> <li><a href="pages.html"><span>Related Pages</span></a></li> </ul></div><h1>graph_cand_gen.h</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span><a name="l00002"></a>00002 <span class="comment"> * Copyright (C) 2005 M.J. Zaki <zaki@cs.rpi.edu> Rensselaer Polytechnic Institute</span><a name="l00003"></a>00003 <span class="comment"> * Written by parimi@cs.rpi.edu</span><a name="l00004"></a>00004 <span class="comment"> * Updated by chaojv@cs.rpi.edu, alhasan@cs.rpi.edu, salems@cs.rpi.edu</span><a name="l00005"></a>00005 <span class="comment"> *</span><a name="l00006"></a>00006 <span class="comment"> * This program is free software; you can redistribute it and/or</span><a name="l00007"></a>00007 <span class="comment"> * modify it under the terms of the GNU General Public License</span><a name="l00008"></a>00008 <span class="comment"> * as published by the Free Software Foundation; either version 2</span><a name="l00009"></a>00009 <span class="comment"> * of the License, or (at your option) any later version.</span><a name="l00010"></a>00010 <span class="comment"> *</span><a name="l00011"></a>00011 <span class="comment"> * This program is distributed in the hope that it will be useful,</span><a name="l00012"></a>00012 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span><a name="l00013"></a>00013 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span><a name="l00014"></a>00014 <span class="comment"> * GNU General Public License for more details.</span><a name="l00015"></a>00015 <span class="comment"> *</span><a name="l00016"></a>00016 <span class="comment"> * You should have received a copy of the GNU General Public License along</span><a name="l00017"></a>00017 <span class="comment"> * with this program; if not, write to the Free Software Foundation, Inc.,</span><a name="l00018"></a>00018 <span class="comment"> * 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.</span><a name="l00019"></a>00019 <span class="comment"> */</span><a name="l00020"></a>00020 <span class="preprocessor">#ifndef _GRAPH_CAND_GEN_H</span><a name="l00021"></a>00021 <span class="preprocessor"></span><span class="preprocessor">#define _GRAPH_CAND_GEN_H</span><a name="l00022"></a>00022 <span class="preprocessor"></span><a name="l00023"></a>00023 <span class="preprocessor">#include "level_one_hmap.h"</span><a name="l00024"></a>00024 <span class="preprocessor">#include "typedefs.h"</span><a name="l00025"></a>00025 <a name="l00026"></a>00026 <span class="keyword">extern</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <span class="keywordtype">int</span> freq_pats_count;<a name="l00027"></a>00027 <span class="keyword">extern</span> <span class="keywordtype">bool</span> print;<a name="l00028"></a>00028 <a name="l00029"></a>00029 <span class="comment">// candidate generation for graphs</span><a name="l00030"></a>00030 <span class="keyword">template</span><<span class="keyword">typename</span> PP, <span class="keyword">class</span> MP, <span class="keyword">class</span> PAT_ST, <span class="keyword">template</span><<span class="keyword">class</span>, <span class="keyword">typename</span>, <span class="keyword">typename</span>, <span class="keyword">template</span> <<span class="keyword">typename</span>> <span class="keyword">class </span>> <span class="keyword">class </span>CC, template <typename> class ALLOC, class EDGE_MAP, class SM_TYPE><a name="l00031"></a>00031 void cand_gen(GRAPH_PATTERN* pat, <span class="keyword">const</span> EDGE_MAP& emap, <span class="keyword">const</span> <span class="keywordtype">int</span>& minsup, <a class="code" href="classpat__fam.html">pat_fam<GRAPH_PATTERN ></a>& freq_pats, <a name="l00032"></a>00032 <a class="code" href="classcount__support.html">count_support<GRAPH_PROP, V_Fk1_MINE_PROP, PAT_ST, CC, ALLOC, SM_TYPE></a>& cs) {<a name="l00033"></a>00033 <a name="l00034"></a>00034 #ifdef PRINT<a name="l00035"></a>00035 cout<<<span class="stringliteral">"In call to cand_gen"</span><<endl; <a name="l00036"></a>00036 <span class="preprocessor">#endif</span><a name="l00037"></a>00037 <span class="preprocessor"></span> <span class="keyword">typedef</span> <a class="code" href="classpat__fam.html">pat_fam<GRAPH_PATTERN></a> PAT_FAM;<a name="l00038"></a>00038 <a name="l00040"></a>00040 back_extensions(pat, emap, minsup, freq_pats, cs);<a name="l00041"></a>00041 <a name="l00043"></a>00043 fwd_extensions(pat, emap, minsup, freq_pats, cs);<a name="l00044"></a>00044 <a name="l00045"></a>00045 }<span class="comment">//end cand_gen()</span><a name="l00046"></a>00046 <a name="l00047"></a>00047 <a name="l00048"></a>00048 <span class="keyword">template</span><<span class="keyword">typename</span> PP, <span class="keyword">class</span> MP, <span class="keyword">class</span> PAT_ST, <span class="keyword">template</span><<span class="keyword">class</span>, <span class="keyword">typename</span>, <span class="keyword">typename</span>, <span class="keyword">template</span> <<span class="keyword">typename</span>> <span class="keyword">class</span>> <span class="keyword">class </span>CC, template <typename> class ALLOC, class EDGE_MAP, class SM_TYPE><a name="l00049"></a>00049 void back_extensions(GRAPH_PATTERN* pat, <span class="keyword">const</span> EDGE_MAP& emap, <span class="keyword">const</span> <span class="keywordtype">int</span>& minsup, <a class="code" href="classpat__fam.html">pat_fam<GRAPH_PATTERN ></a>& freq_pats, <a name="l00050"></a>00050 <a class="code" href="classcount__support.html">count_support<GRAPH_PROP, V_Fk1_MINE_PROP, PAT_ST, CC, ALLOC, SM_TYPE></a>& cs) {<a name="l00051"></a>00051 <a name="l00052"></a>00052 <span class="keywordflow">if</span>(pat->rmp_size()<3) <span class="comment">// back extensions only for graphs with rmost path </span><a name="l00053"></a>00053 <span class="keywordflow">return</span>; <span class="comment">// with atleast two edges</span><a name="l00054"></a>00054 <span class="preprocessor">#ifdef PRINT</span><a name="l00055"></a>00055 <span class="preprocessor"></span> cout<<<span class="stringliteral">"Back extension for "</span><<pat<<endl;<a name="l00056"></a>00056 <span class="preprocessor">#endif</span><a name="l00057"></a>00057 <span class="preprocessor"></span> <span class="keyword">typedef</span> <a class="code" href="classpat__fam.html">pat_fam<GRAPH_PATTERN></a> PAT_FAM;<a name="l00058"></a>00058 <a name="l00059"></a>00059 <span class="keyword">const</span> <span class="keyword">typename</span> GRAPH_PATTERN::VERTEX_T& last_v=pat->rmost_vertex();<a name="l00060"></a>00060 <span class="keyword">const</span> <span class="keyword">typename</span> GRAPH_PATTERN::RMP_T& rmp=pat->rmost_path();<a name="l00061"></a>00061 <span class="keyword">typename</span> GRAPH_PATTERN::RMP_T::const_iterator rmp_it;<a name="l00062"></a>00062 <span class="keyword">typename</span> GRAPH_PATTERN::EDGE_T e;<a name="l00063"></a>00063 GRAPH_PATTERN* edge=0;<a name="l00064"></a>00064 GRAPH_PATTERN* cand_pat=0;<a name="l00065"></a>00065 <span class="keywordtype">int</span> rvid=pat->rmost_vid();<a name="l00066"></a>00066 <span class="keywordtype">int</span> vid;<a name="l00067"></a>00067 <a name="l00068"></a>00068 <span class="comment">// determine vid on rmp from where to start adding back edges</span><a name="l00069"></a>00069 rmp_it=rmp.end()-3;<a name="l00070"></a>00070 <span class="keywordflow">while</span>(<span class="keyword">true</span>) {<a name="l00071"></a>00071 <span class="keywordflow">if</span>(rmp_it<rmp.begin())<a name="l00072"></a>00072 <span class="keywordflow">break</span>;<a name="l00073"></a>00073 <span class="keywordflow">if</span>(pat->get_out_edge(rvid, *rmp_it, e)) {<a name="l00074"></a>00074 rmp_it++;<a name="l00075"></a>00075 <span class="keywordflow">break</span>;<a name="l00076"></a>00076 }<a name="l00077"></a>00077 rmp_it--;<a name="l00078"></a>00078 }<a name="l00079"></a>00079 <a name="l00080"></a>00080 <span class="keywordflow">if</span>(rmp_it<rmp.begin())<a name="l00081"></a>00081 rmp_it++;<a name="l00082"></a>00082 <a name="l00083"></a>00083 <span class="keywordflow">while</span>(rmp_it<rmp.end()-2) {<a name="l00084"></a>00084 vid=*rmp_it;<a name="l00085"></a>00085 <span class="keyword">const</span> <span class="keyword">typename</span> GRAPH_PATTERN::VERTEX_T& back_v=pat->label(vid);<a name="l00086"></a>00086 <a name="l00087"></a>00087 <span class="keyword">const</span> <span class="keyword">typename</span> EDGE_MAP::LABELS& lbls=emap.get_labels(last_v, back_v);<a name="l00088"></a>00088 <span class="keyword">typename</span> EDGE_MAP::CONST_LIT lit=lbls.begin();<a name="l00089"></a>00089 <a name="l00090"></a>00090 <span class="comment">// get all possible labels for this back edge</span><a name="l00091"></a>00091 <span class="keywordflow">while</span>(lit!=lbls.end()) {<a name="l00092"></a>00092 <a name="l00093"></a>00093 <span class="comment">// construct new candidate with this label</span><a name="l00094"></a>00094 cand_pat=pat->clone();<a name="l00095"></a>00095 cand_pat->add_out_edge(rvid, vid, *lit);<a name="l00096"></a>00096 cand_pat->add_out_edge(vid, rvid, *lit);<a name="l00097"></a>00097 <a name="l00098"></a>00098 <span class="keywordflow">if</span>(!check_isomorphism(cand_pat)) {<a name="l00099"></a>00099 <span class="keyword">delete</span> cand_pat;<a name="l00100"></a>00100 cand_pat=0;<a name="l00101"></a>00101 lit++;<a name="l00102"></a>00102 <span class="keywordflow">continue</span>;<a name="l00103"></a>00103 }<a name="l00104"></a>00104 <a name="l00105"></a>00105 <span class="comment">// create the one edged-pattern</span><a name="l00106"></a>00106 edge=<span class="keyword">new</span> GRAPH_PATTERN;<a name="l00107"></a>00107 <span class="keywordflow">if</span>(last_v<back_v)<a name="l00108"></a>00108 make_edge(edge, last_v, back_v, *lit);<a name="l00109"></a>00109 <span class="keywordflow">else</span><a name="l00110"></a>00110 make_edge(edge, back_v, last_v, *lit);<a name="l00111"></a>00111 <span class="preprocessor">#ifdef PRINT</span><a name="l00112"></a>00112 <span class="preprocessor"></span> cout<<<span class="stringliteral">"Trying with back edge="</span><<edge<<endl;<a name="l00113"></a>00113 cout<<<span class="stringliteral">"New candidate="</span><<cand_pat<<endl;<a name="l00114"></a>00114 <span class="preprocessor">#endif</span><a name="l00115"></a>00115 <span class="preprocessor"></span> <span class="comment">// count support</span><a name="l00116"></a>00116 cs.count(pat, edge, &cand_pat, minsup, 1);<a name="l00117"></a>00117 <a name="l00118"></a>00118 <span class="keyword">delete</span> edge;<a name="l00119"></a>00119 edge=0;⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -