📄 graph__cand__gen_8h-source.html
字号:
<a name="l00120"></a>00120 <a name="l00121"></a>00121 <span class="comment">// recursive call for frequent graph</span><a name="l00122"></a>00122 <span class="keywordflow">if</span>(cand_pat->is_valid(minsup)) {<a name="l00123"></a>00123 <span class="comment">//freq_pats.push_back(cand_pat);</span><a name="l00124"></a>00124 freq_pats_count++;<a name="l00125"></a>00125 <span class="keywordflow">if</span>(print)<a name="l00126"></a>00126 cout << cand_pat;<a name="l00127"></a>00127 cand_gen(cand_pat, emap, minsup, freq_pats, cs);<a name="l00128"></a>00128 cs.delete_vat(cand_pat);<a name="l00129"></a>00129 }<a name="l00130"></a>00130 <span class="comment">// else {</span><a name="l00131"></a>00131 <span class="keyword">delete</span> cand_pat;<a name="l00132"></a>00132 cand_pat=0;<a name="l00133"></a>00133 <span class="comment">// }</span><a name="l00134"></a>00134 <a name="l00135"></a>00135 lit++;<a name="l00136"></a>00136 }<span class="comment">//end while lit</span><a name="l00137"></a>00137 <a name="l00138"></a>00138 rmp_it++;<a name="l00139"></a>00139 }<span class="comment">//end while rmp_it</span><a name="l00140"></a>00140 <a name="l00141"></a>00141 }<span class="comment">//end back_extensions()</span><a name="l00142"></a>00142 <a name="l00143"></a>00143 <a name="l00144"></a>00144 <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">typename</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="l00145"></a>00145 void fwd_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="l00146"></a>00146 <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="l00147"></a>00147 #ifdef PRINT<a name="l00148"></a>00148 cout<<<span class="stringliteral">"Fwd extension for "</span><<pat<<endl;<a name="l00149"></a>00149 <span class="preprocessor">#endif</span><a name="l00150"></a>00150 <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="l00151"></a>00151 <a name="l00152"></a>00152 <span class="keyword">const</span> <span class="keyword">typename</span> GRAPH_PATTERN::RMP_T& rmp=pat->rmost_path();<a name="l00153"></a>00153 <span class="keyword">typename</span> GRAPH_PATTERN::RMP_T::const_iterator rmp_it;<a name="l00154"></a>00154 <a name="l00155"></a>00155 <span class="keyword">typename</span> EDGE_MAP::CONST_NIT nit;<a name="l00156"></a>00156 <span class="keyword">typename</span> EDGE_MAP::CONST_LIT lit; <a name="l00157"></a>00157 GRAPH_PATTERN* edge=0;<a name="l00158"></a>00158 GRAPH_PATTERN* cand_pat=0;<a name="l00159"></a>00159 <span class="keywordtype">int</span> lvid;<a name="l00160"></a>00160 <a name="l00161"></a>00161 <span class="keywordflow">for</span>(rmp_it=rmp.end()-1; rmp_it>=rmp.begin(); rmp_it--) {<a name="l00162"></a>00162 <span class="keyword">const</span> <span class="keyword">typename</span> GRAPH_PATTERN::VERTEX_T& src_v=pat->label(*rmp_it);<a name="l00163"></a>00163 <span class="keyword">const</span> <span class="keyword">typename</span> EDGE_MAP::NEIGHBORS& nbrs=emap.get_neighbors(src_v);<a name="l00164"></a>00164 <a name="l00165"></a>00165 <span class="keywordflow">for</span>(nit=nbrs.begin(); nit!=nbrs.end(); nit++) {<a name="l00166"></a>00166 <span class="keyword">const</span> <span class="keyword">typename</span> GRAPH_PATTERN::VERTEX_T& dest_v=nit->first;<a name="l00167"></a>00167 <a name="l00168"></a>00168 <span class="keywordflow">for</span>(lit=nit->second.begin(); lit!=nit->second.end(); lit++) {<a name="l00169"></a>00169 <span class="comment">// construct new candidate</span><a name="l00170"></a>00170 cand_pat=pat->clone();<a name="l00171"></a>00171 lvid=cand_pat->add_vertex(dest_v);<a name="l00172"></a>00172 cand_pat->add_out_edge(*rmp_it, lvid, *lit);<a name="l00173"></a>00173 cand_pat->add_out_edge(lvid, *rmp_it, *lit);<a name="l00174"></a>00174 <span class="preprocessor">#ifdef PRINT</span><a name="l00175"></a>00175 <span class="preprocessor"></span> <span class="comment">// cout<<"New candidate="<<cand_pat<<endl;</span><a name="l00176"></a>00176 <span class="preprocessor">#endif</span><a name="l00177"></a>00177 <span class="preprocessor"></span> <span class="keywordflow">if</span>(!check_isomorphism(cand_pat)) {<a name="l00178"></a>00178 <span class="preprocessor">#ifdef PRINT</span><a name="l00179"></a>00179 <span class="preprocessor"></span> cout<<<span class="stringliteral">"New candidate="</span><<cand_pat<<endl;<a name="l00180"></a>00180 cout<<<span class="stringliteral">"candidate did NOT pass isomorphism"</span><<endl;<a name="l00181"></a>00181 <span class="preprocessor">#endif</span><a name="l00182"></a>00182 <span class="preprocessor"></span> <span class="keyword">delete</span> cand_pat;<a name="l00183"></a>00183 cand_pat=0;<a name="l00184"></a>00184 <span class="keywordflow">continue</span>;<a name="l00185"></a>00185 } <a name="l00186"></a>00186 <span class="keywordflow">else</span> {<a name="l00187"></a>00187 <span class="preprocessor">#ifdef PRINT</span><a name="l00188"></a>00188 <span class="preprocessor"></span> cout<<<span class="stringliteral">"New candidate="</span><<cand_pat<<endl;<a name="l00189"></a>00189 cout<<<span class="stringliteral">"candidate passed isomorphism"</span><<endl;<a name="l00190"></a>00190 <span class="preprocessor">#endif</span><a name="l00191"></a>00191 <span class="preprocessor"></span> }<a name="l00192"></a>00192 <a name="l00193"></a>00193 <span class="comment">// create edge</span><a name="l00194"></a>00194 edge=<span class="keyword">new</span> GRAPH_PATTERN;<a name="l00195"></a>00195 <span class="keywordflow">if</span>(src_v<dest_v)<a name="l00196"></a>00196 make_edge(edge, src_v, dest_v, *lit);<a name="l00197"></a>00197 <span class="keywordflow">else</span><a name="l00198"></a>00198 make_edge(edge, dest_v, src_v, *lit);<a name="l00199"></a>00199 <a name="l00200"></a>00200 <span class="preprocessor">#ifdef PRINT</span><a name="l00201"></a>00201 <span class="preprocessor"></span> cout<<<span class="stringliteral">"Trying with edge="</span><<edge<<endl;<a name="l00202"></a>00202 <span class="preprocessor">#endif</span><a name="l00203"></a>00203 <span class="preprocessor"></span> <span class="comment">// count support</span><a name="l00204"></a>00204 cs.count(pat, edge, &cand_pat, minsup, 1);<a name="l00205"></a>00205 <a name="l00206"></a>00206 <span class="keyword">delete</span> edge;<a name="l00207"></a>00207 edge=0;<a name="l00208"></a>00208 <a name="l00209"></a>00209 <span class="comment">// recursive call for frequent graph</span><a name="l00210"></a>00210 <span class="keywordflow">if</span>(cand_pat->is_valid(minsup)) {<a name="l00211"></a>00211 <span class="comment">// freq_pats.push_back(cand_pat);</span><a name="l00212"></a>00212 <span class="keywordflow">if</span>(print)<a name="l00213"></a>00213 cout << cand_pat;<a name="l00214"></a>00214 freq_pats_count++;<a name="l00215"></a>00215 cand_gen(cand_pat, emap, minsup, freq_pats, cs);<a name="l00216"></a>00216 cs.delete_vat(cand_pat);<a name="l00217"></a>00217 }<a name="l00218"></a>00218 <span class="comment">// else {</span><a name="l00219"></a>00219 <span class="keyword">delete</span> cand_pat;<a name="l00220"></a>00220 cand_pat=0;<a name="l00221"></a>00221 <span class="comment">// }</span><a name="l00222"></a>00222 <a name="l00223"></a>00223 }<span class="comment">//end for lit</span><a name="l00224"></a>00224 }<span class="comment">//end for nit </span><a name="l00225"></a>00225 }<span class="comment">//end for rmp_it</span><a name="l00226"></a>00226 <a name="l00227"></a>00227 }<span class="comment">//end fwd_extensions()</span><a name="l00228"></a>00228 <a name="l00229"></a>00229 <a name="l00233"></a>00233 <span class="comment">// it is assumed that v1<=v2 for VAT intersection to work, this function does </span><a name="l00234"></a>00234 <span class="comment">// not verify it;</span><a name="l00235"></a>00235 <span class="comment">// in particular, storage_manager for a single undirected edge (A-B) stores it </span><a name="l00236"></a>00236 <span class="comment">// as canonical code A-B and not B-A.</span><a name="l00237"></a>00237 <a name="l00238"></a>00238 <span class="keyword">template</span><<span class="keyword">typename</span> pattern, <span class="keyword">typename</span> V_T, <span class="keyword">typename</span> E_T><a name="l00239"></a>00239 <span class="keywordtype">void</span> make_edge(<a class="code" href="classpattern.html">pattern</a>* p, <span class="keyword">const</span> V_T& v1,<span class="keyword">const</span> V_T& v2, <span class="keyword">const</span> E_T& e) {<a name="l00240"></a>00240 p-><a class="code" href="classpattern.html#a7a0c9e586643031469f44d15ead5d37">add_vertex</a>(v1);<a name="l00241"></a>00241 p-><a class="code" href="classpattern.html#a7a0c9e586643031469f44d15ead5d37">add_vertex</a>(v2);<a name="l00242"></a>00242 p-><a class="code" href="classpattern.html#ac5dd176b16659ebd9fc665a1a77eea2">add_out_edge</a>(0, 1, e);<a name="l00243"></a>00243 p-><a class="code" href="classpattern.html#ac5dd176b16659ebd9fc665a1a77eea2">add_out_edge</a>(1, 0, e);<a name="l00244"></a>00244 p-><a class="code" href="classpattern.html#b7c9f6193c9eccef49f6ce8fcc837661">init_canonical_code</a>(<a class="code" href="structfive__tuple.html">five_tuple<V_T, E_T></a>(0, 1, p-><a class="code" href="classpattern.html#4e1adb7fbf83795c46cdedd9d5a0c923">label</a>(0), e, p-><a class="code" href="classpattern.html#4e1adb7fbf83795c46cdedd9d5a0c923">label</a>(1)));<a name="l00245"></a>00245 } <span class="comment">//end make_edge()</span><a name="l00246"></a>00246 <a name="l00247"></a>00247 <span class="preprocessor">#endif</span></pre></div><hr size="1"><address style="align: right;"><small>Generated on Wed Jul 26 14:01:08 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 + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -