graph__evat_8h-source.html
来自「这是一个用于数据挖掘的常用算法的模板库（数据挖掘的C++模板库for UNIX)」· HTML 代码 · 共 389 行 · 第 1/3 页
HTML
389 行
<a name="l00261"></a>00261 <span class="preprocessor"></span> pair<int, int> new_occurrence;<a name="l00262"></a>00262 <span class="keywordflow">if</span>(!l2_eq)<a name="l00263"></a>00263 new_occurrence.first=(is_fwd_chain?it_evat_v1->second: it_evat_v1->first);<a name="l00264"></a>00264 <span class="keywordflow">else</span><a name="l00265"></a>00265 new_occurrence.first=(!l2_swap?it_evat_v1->second: it_evat_v1->first);<a name="l00266"></a>00266 new_occurrence.second=(swap_vids?it_evat_v2->first: it_evat_v2->second);<a name="l00267"></a>00267 <a name="l00268"></a>00268 <span class="comment">// now append this occurrence to vat</span><a name="l00269"></a>00269 <span class="keywordflow">if</span>(!is_fwd_chain) {<a name="l00270"></a>00270 <span class="keywordflow">if</span>(!cand_vat.empty() && cand_vat.back().first==v1.first) { <span class="comment">// new occurrence in same tid</span><a name="l00271"></a>00271 #ifdef PRINT<a name="l00272"></a>00272 cout<<<span class="stringliteral">"!fwd_chain, same tid"</span><<endl;<a name="l00273"></a>00273 <span class="preprocessor">#endif</span><a name="l00274"></a>00274 <span class="preprocessor"></span> cand_vat.insert_occurrence(new_occurrence); <a name="l00275"></a>00275 cand_vat.insert_vid(new_occurrence.first);<a name="l00276"></a>00276 cand_vat.insert_vid(new_occurrence.second);<a name="l00277"></a>00277 }<a name="l00278"></a>00278 <span class="keywordflow">else</span> { <span class="comment">// new tid</span><a name="l00279"></a>00279 <span class="preprocessor">#ifdef PRINT</span><a name="l00280"></a>00280 <span class="preprocessor"></span> cout<<<span class="stringliteral">"!fwd_chain, new tid"</span><<endl;<a name="l00281"></a>00281 <span class="preprocessor">#endif</span><a name="l00282"></a>00282 <span class="preprocessor"></span> cand_vat.insert_occurrence_tid(v1.first, new_occurrence);<a name="l00283"></a>00283 cand_vat.insert_vid(new_occurrence.first);<a name="l00284"></a>00284 cand_vat.insert_vid(new_occurrence.second);<a name="l00285"></a>00285 }<a name="l00286"></a>00286 }<a name="l00287"></a>00287 <span class="keywordflow">else</span> { <span class="comment">//assert: a new entry for this tid would have been created </span><a name="l00288"></a>00288 <span class="comment">// by the copied vats</span><a name="l00289"></a>00289 <span class="keywordflow">if</span>(cand_vat.back().second.size()==(unsigned) rmp_index) { <a name="l00290"></a>00290 <span class="comment">// this is the first time this edge's evat is being inserted</span><a name="l00291"></a>00291 <span class="preprocessor">#ifdef PRINT</span><a name="l00292"></a>00292 <span class="preprocessor"></span> cout<<<span class="stringliteral">"fwd_chain, new evat"</span><<endl;<a name="l00293"></a>00293 <span class="preprocessor">#endif</span><a name="l00294"></a>00294 <span class="preprocessor"></span> cand_vat.insert_occurrence_evat(new_occurrence);<a name="l00295"></a>00295 cand_vat.insert_vid(new_occurrence.first);<a name="l00296"></a>00296 cand_vat.insert_vid(new_occurrence.second);<a name="l00297"></a>00297 }<a name="l00298"></a>00298 <span class="keywordflow">else</span> {<a name="l00299"></a>00299 <span class="preprocessor">#ifdef PRINT</span><a name="l00300"></a>00300 <span class="preprocessor"></span> cout<<<span class="stringliteral">"fwd_chain, new occurrence"</span><<endl;<a name="l00301"></a>00301 <span class="preprocessor">#endif</span><a name="l00302"></a>00302 <span class="preprocessor"></span> cand_vat.insert_occurrence(new_occurrence);<a name="l00303"></a>00303 cand_vat.insert_vid(new_occurrence.first);<a name="l00304"></a>00304 cand_vat.insert_vid(new_occurrence.second);<a name="l00305"></a>00305 }<a name="l00306"></a>00306 }<a name="l00307"></a>00307 }<span class="comment">//end for it_evat_v2</span><a name="l00308"></a>00308 }<a name="l00309"></a>00309 }<span class="comment">//end fwd_intersect()</span><a name="l00310"></a>00310 <a name="l00311"></a>00311 <a name="l00314"></a>00314 <span class="keyword">template</span><<span class="keyword">template</span><<span class="keyword">typename</span>, <span class="keyword">typename</span>> <span class="keyword">class </span>VAT_ST, <span class="keyword">typename</span> VAT, <span class="keyword">template</span> <<span class="keyword">typename</span>> <span class="keyword">class </span>ALLOC><a name="l00315"></a><a class="code" href="classevat.html#a1fea2d152697ef4dafab9bb9679a1cc">00315</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="classevat.html#a1fea2d152697ef4dafab9bb9679a1cc">back_intersect</a>(<span class="keyword">const</span> VAT& vat_v1, <span class="keyword">const</span> <a class="code" href="classevat.html">evat</a>& evat_v1, <span class="keyword">const</span> <a class="code" href="classevat.html">evat</a>& evat_v2, VAT& cand_vat, <a name="l00316"></a>00316 <span class="keyword">const</span> <span class="keywordtype">int</span>& back_idx, <span class="keyword">const</span> <span class="keywordtype">int</span>& new_edge_state, <span class="keyword">const</span> <span class="keywordtype">int</span>& tid) {<a name="l00317"></a>00317 <span class="preprocessor">#ifdef PRINT</span><a name="l00318"></a>00318 <span class="preprocessor"></span> cout<<<span class="stringliteral">"evat.back_intersect entered with back_idx="</span><<back_idx<<<span class="stringliteral">" "</span><<<span class="stringliteral">"new_edge_stat="</span><<new_edge_state<<<span class="stringliteral">" tid="</span><<tid<<endl;<a name="l00319"></a>00319 <span class="preprocessor">#endif</span><a name="l00320"></a>00320 <span class="preprocessor"></span> <span class="keyword">const</span> VAT_ST<typename VAT::VSET, ALLOC<typename VAT::VSET> >& v1_vids=vat_v1._vids[tid];<a name="l00321"></a>00321 <span class="keyword">const</span> pair<int, VAT_ST<evat, ALLOC<evat> > >& v1=vat_v1._vat[tid];<a name="l00322"></a>00322 CONST_IT it_evat_v1, it_evat_v2;<a name="l00323"></a>00323 <a name="l00324"></a>00324 <span class="keywordtype">int</span> offset_v1;<a name="l00325"></a>00325 <a name="l00326"></a>00326 <span class="keywordtype">bool</span> swap_vids; <span class="comment">// flag to denote if vids in evat_v2 should be swapped </span><a name="l00327"></a>00327 <span class="comment">// before comparison with v1</span><a name="l00328"></a>00328 <a name="l00329"></a>00329 <span class="keywordflow">for</span>(it_evat_v1=evat_v1.<a class="code" href="classevat.html#576e837271071e10535be5b0276c06c6">begin</a>(), offset_v1=0; it_evat_v1!=evat_v1.<a class="code" href="classevat.html#eb2eff3b7a1e3a340731d33ecb472ebf">end</a>(); it_evat_v1++, offset_v1++)<a name="l00330"></a>00330 <span class="keywordflow">for</span>(it_evat_v2=evat_v2.<a class="code" href="classevat.html#576e837271071e10535be5b0276c06c6">begin</a>(); it_evat_v2!=evat_v2.<a class="code" href="classevat.html#eb2eff3b7a1e3a340731d33ecb472ebf">end</a>(); it_evat_v2++) {<a name="l00332"></a>00332 <a name="l00333"></a>00333 <span class="keywordflow">if</span>(!new_edge_state) {<a name="l00334"></a>00334 <span class="keywordflow">if</span>(it_evat_v1->second!=it_evat_v2->first)<a name="l00335"></a>00335 <span class="keywordflow">if</span>(it_evat_v1->second!=it_evat_v2->second) <span class="comment">// none of the vids in v2 matches</span><a name="l00336"></a>00336 <span class="keywordflow">continue</span>;<a name="l00337"></a>00337 <span class="keywordflow">else</span><a name="l00338"></a>00338 swap_vids=1;<a name="l00339"></a>00339 <span class="keywordflow">else</span><a name="l00340"></a>00340 swap_vids=0;<a name="l00341"></a>00341 }<a name="l00342"></a>00342 <span class="keywordflow">else</span> {<a name="l00343"></a>00343 swap_vids=new_edge_state-1;<a name="l00344"></a>00344 <a name="l00345"></a>00345 <span class="comment">// check it's of the form A-B, B-C</span><a name="l00346"></a>00346 <span class="keywordflow">if</span>(!swap_vids && it_evat_v1->second!=it_evat_v2->first)<a name="l00347"></a>00347 <span class="keywordflow">continue</span>;<a name="l00348"></a>00348 <span class="keywordflow">if</span>(swap_vids && it_evat_v1->second!=it_evat_v2->second)<a name="l00349"></a>00349 <span class="keywordflow">continue</span>;<a name="l00350"></a>00350 }<a name="l00351"></a>00351 <a name="l00352"></a>00352 <span class="comment">// check that the back vertex is right one in this occurrence</span><a name="l00353"></a>00353 <span class="keywordflow">if</span>(!swap_vids && v1.second[back_idx][offset_v1].first!=it_evat_v2->second)<a name="l00354"></a>00354 <span class="keywordflow">continue</span>;<a name="l00355"></a>00355 <span class="keywordflow">if</span>(swap_vids && v1.second[back_idx][offset_v1].first!=it_evat_v2->first)<a name="l00356"></a>00356 <span class="keywordflow">continue</span>;<a name="l00357"></a>00357 <a name="l00358"></a>00358 <span class="comment">// this is a valid back extension</span><a name="l00359"></a>00359 <span class="comment">// no new evat is prepared for a back extension</span><a name="l00360"></a>00360 <span class="comment">// simply copy the appropriate ones to cand_vat</span><a name="l00361"></a>00361 <span class="keywordflow">if</span>(!cand_vat.empty() && cand_vat.back().first==v1.first) {<a name="l00362"></a>00362 <span class="comment">// this tid exists</span><a name="l00363"></a>00363 cand_vat.copy_vats(v1, offset_v1, v1.second.size());<a name="l00364"></a>00364 cand_vat.copy_vids_hs(v1_vids[offset_v1]);<a name="l00365"></a>00365 }<a name="l00366"></a>00366 <span class="keywordflow">else</span> {<a name="l00367"></a>00367 <span class="comment">// this is a new tid, create a new entry in vat</span><a name="l00368"></a>00368 cand_vat.copy_vats_tid(v1, offset_v1, v1.second.size());<a name="l00369"></a>00369 cand_vat.copy_vids_tid(v1_vids[offset_v1]);<a name="l00370"></a>00370 }<a name="l00371"></a>00371 }<span class="comment">//end for it_evat_v2</span><a name="l00372"></a>00372 }<span class="comment">//end back_intersect()</span><a name="l00373"></a>00373 <a name="l00374"></a>00374 <span class="keyword">private</span>:<a name="l00375"></a>00375 <a class="code" href="classevat.html#38c8ee4ef89ea8e9476013cabc7e217e">EVAT</a> _evat;<a name="l00376"></a>00376 };<a name="l00377"></a>00377 <a name="l00378"></a>00378 <span class="keyword">template</span> <<span class="keyword">template</span> <<span class="keyword">typename</span>> <span class="keyword">class </span>ALLOC ><a name="l00379"></a>00379 ostream& operator<< (ostream& ostr, const evat<ALLOC>& ev) {<a name="l00380"></a>00380 <span class="keyword">typename</span> <a class="code" href="classevat.html">evat<ALLOC>::CONST_IT</a> it;<a name="l00381"></a>00381 <span class="keywordflow">for</span>(it=ev.begin(); it!=ev.end(); it++)<a name="l00382"></a>00382 ostr<<it->first<<<span class="stringliteral">","</span><<it->second<<<span class="stringliteral">" "</span>;<a name="l00383"></a>00383 <span class="keywordflow">return</span> ostr;<a name="l00384"></a>00384 }<a name="l00385"></a>00385 <a name="l00386"></a>00386 <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 + =
减小字号Ctrl + -
显示快捷键?