📄 tree__iso__check_8h-source.html
字号:
<a name="l00119"></a>00119 <span class="keywordtype">bool</span> max_one_child=<span class="keyword">false</span>;<a name="l00120"></a>00120 <a name="l00121"></a>00121 <a name="l00122"></a>00122 <span class="keywordflow">if</span>(eit_pair.first!=eit_pair.second)<a name="l00123"></a>00123 eit_pair.second--;<a name="l00124"></a>00124 <span class="keywordflow">else</span><a name="l00125"></a>00125 max_one_child=<span class="keyword">true</span>;<a name="l00126"></a>00126 <a name="l00127"></a>00127 <span class="keywordflow">if</span>(eit_pair.first==eit_pair.second)<a name="l00128"></a>00128 max_one_child=<span class="keyword">true</span>;<a name="l00129"></a>00129 <span class="keywordflow">else</span><a name="l00130"></a>00130 eit_pair.second--;<a name="l00131"></a>00131 <a name="l00132"></a>00132 <span class="keywordflow">if</span>(!max_one_child && !check_subtree_order(eit_pair.second, cand_pat)) {<a name="l00133"></a>00133 <span class="comment">// last 2 subtrees of this vid were not ordered canonically</span><a name="l00134"></a>00134 cand_pat->_is_canonical=<span class="keyword">false</span>;<a name="l00135"></a>00135 <span class="keywordflow">return</span> <span class="keyword">false</span>;<a name="l00136"></a>00136 }<a name="l00137"></a>00137 it--;<a name="l00138"></a>00138 }<a name="l00139"></a>00139 <a name="l00140"></a>00140 <span class="comment">// execution reaches this point only if isomorphism check was passed</span><a name="l00141"></a>00141 cand_pat->_is_canonical=<span class="keyword">true</span>;<a name="l00142"></a>00142 <span class="keywordflow">return</span> <span class="keyword">true</span>;<a name="l00143"></a>00143 <a name="l00144"></a>00144 }<span class="comment">//end check_isomorphsim()</span><a name="l00145"></a>00145 <a name="l00148"></a>00148 <span class="keyword">template</span><<span class="keyword">typename</span> EIT, <span class="keyword">typename</span> PATTERN><a name="l00149"></a>00149 <span class="keywordtype">bool</span> check_subtree_order(EIT& edge_it, <span class="keyword">const</span> PATTERN*<span class="keyword">const</span>& cand_pat) {<a name="l00150"></a>00150 <span class="comment">/* This function in effect imposes the <= ordering defined on pg 1007 of </span><a name="l00151"></a>00151 <span class="comment"> SLEUTH */</span><a name="l00152"></a>00152 <a name="l00153"></a>00153 <span class="comment">// x and y are names for the two respective nodes being compared</span><a name="l00154"></a>00154 <span class="keywordtype">int</span> vid_x=edge_it->first;<a name="l00155"></a>00155 edge_it++;<a name="l00156"></a>00156 <span class="keywordtype">int</span> vid_y=edge_it->first;<a name="l00157"></a>00157 <a name="l00158"></a>00158 <span class="keyword">typename</span> PATTERN::CONST_EIT_PAIR edges;<a name="l00159"></a>00159 <span class="keyword">typedef</span> pair<int, int> st_pair;<a name="l00160"></a>00160 <a name="l00161"></a>00161 stack<st_pair> stack_x;<a name="l00162"></a>00162 stack<st_pair> stack_y;<a name="l00163"></a>00163 <a name="l00164"></a>00164 stack_x.push(make_pair(vid_x, 0));<a name="l00165"></a>00165 stack_y.push(make_pair(vid_y, 0));<a name="l00166"></a>00166 <a name="l00167"></a>00167 <span class="keywordflow">while</span>(!stack_x.empty() && !stack_y.empty()) {<a name="l00168"></a>00168 <a name="l00169"></a>00169 <span class="keyword">const</span> st_pair& node_x=stack_x.top();<a name="l00170"></a>00170 stack_x.pop();<a name="l00171"></a>00171 <span class="keyword">const</span> st_pair& node_y=stack_y.top();<a name="l00172"></a>00172 stack_y.pop();<a name="l00173"></a>00173 <a name="l00175"></a>00175 <span class="keywordflow">if</span>(node_x.second<node_y.second) {<a name="l00176"></a>00176 <span class="comment">// y is deeper</span><a name="l00177"></a>00177 <span class="keywordflow">return</span> <span class="keyword">false</span>;<a name="l00178"></a>00178 }<a name="l00179"></a>00179 <a name="l00180"></a>00180 <span class="keywordflow">if</span>(node_x.second>node_y.second) {<a name="l00181"></a>00181 <span class="comment">// x is deeper</span><a name="l00182"></a>00182 <span class="keywordflow">return</span> <span class="keyword">true</span>;<a name="l00183"></a>00183 }<a name="l00184"></a>00184 <a name="l00186"></a>00186 <span class="keywordflow">if</span>(cand_pat->label(node_x.first) < cand_pat->label(node_y.first)) {<a name="l00187"></a>00187 <span class="keywordflow">return</span> <span class="keyword">true</span>;<a name="l00188"></a>00188 }<a name="l00189"></a>00189 <a name="l00190"></a>00190 <span class="keywordflow">if</span>(cand_pat->label(node_x.first) > cand_pat->label(node_y.first)) {<a name="l00191"></a>00191 <span class="keywordflow">return</span> <span class="keyword">false</span>;<a name="l00192"></a>00192 }<a name="l00193"></a>00193 <a name="l00194"></a>00194 <span class="comment">// push edges of x in reverse order</span><a name="l00195"></a>00195 edges=cand_pat->out_edges(node_x.first);<a name="l00196"></a>00196 <span class="keywordflow">if</span>(edges.second!=edges.first) {<a name="l00197"></a>00197 edges.second--;<a name="l00198"></a>00198 <span class="keywordflow">while</span>(edges.second!=edges.first) {<a name="l00199"></a>00199 stack_x.push(make_pair(edges.second->first, node_x.second+1));<a name="l00200"></a>00200 edges.second--;<a name="l00201"></a>00201 }<a name="l00202"></a>00202 stack_x.push(make_pair(edges.second->first, node_x.second+1));<a name="l00203"></a>00203 }<a name="l00204"></a>00204 <a name="l00205"></a>00205 <span class="comment">// push edges of y in reverse order</span><a name="l00206"></a>00206 edges=cand_pat->out_edges(node_y.first);<a name="l00207"></a>00207 <span class="keywordflow">if</span>(edges.second!=edges.first) {<a name="l00208"></a>00208 edges.second--;<a name="l00209"></a>00209 <span class="keywordflow">while</span>(edges.second!=edges.first) {<a name="l00210"></a>00210 stack_y.push(make_pair(edges.second->first, node_y.second+1));<a name="l00211"></a>00211 edges.second--;<a name="l00212"></a>00212 }<a name="l00213"></a>00213 stack_y.push(make_pair(edges.second->first, node_y.second+1));<a name="l00214"></a>00214 }<a name="l00215"></a>00215 <a name="l00216"></a>00216 }<span class="comment">//end while stacks not empty</span><a name="l00217"></a>00217 <a name="l00218"></a>00218 <span class="keywordflow">if</span>(!stack_x.empty()) {<a name="l00219"></a>00219 <span class="comment">// x is deeper</span><a name="l00220"></a>00220 <span class="keywordflow">return</span> <span class="keyword">true</span>;<a name="l00221"></a>00221 }<a name="l00222"></a>00222 <a name="l00223"></a>00223 <span class="keywordflow">if</span>(!stack_y.empty()) {<a name="l00224"></a>00224 <span class="comment">// y is deeper </span><a name="l00225"></a>00225 <span class="keywordflow">return</span> <span class="keyword">false</span>;<a name="l00226"></a>00226 }<a name="l00227"></a>00227 <a name="l00228"></a>00228 <span class="comment">// both stacks were empty i.e. equal subtrees</span><a name="l00229"></a>00229 <span class="keywordflow">return</span> <span class="keyword">true</span>;<a name="l00230"></a>00230 <a name="l00231"></a>00231 }<span class="comment">//end check_subtree_order()</span><a name="l00232"></a>00232 <a name="l00233"></a>00233 <a name="l00237"></a>00237 <span class="keyword">template</span><<span class="keyword">class</span> PP, <span class="keyword">class</span> MP, <span class="keyword">class</span> 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,<a name="l00238"></a>00238 template <typename> class ALLOC ><a name="l00239"></a>00239 bool check_isomorphism(pattern<ORD_TREE_PROP, MP, ST, CC, ALLOC>*<span class="keyword">const</span>& cand_pat) {<a name="l00240"></a>00240 update_rmost_path(cand_pat);<a name="l00241"></a>00241 cand_pat->_is_canonical=<span class="keyword">true</span>;<a name="l00242"></a>00242 <span class="keywordflow">return</span> <span class="keyword">true</span>;<a name="l00243"></a>00243 }<a name="l00244"></a>00244 <a name="l00245"></a>00245 <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 + -