📄 tree__iso__check_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: tree_iso_check.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>tree_iso_check.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="comment">// isomorphism cheking for trees</span><a name="l00021"></a>00021 <a name="l00022"></a>00022 <span class="preprocessor">#ifndef _TREE_ISO_CHECK_H_</span><a name="l00023"></a>00023 <span class="preprocessor"></span><span class="preprocessor">#define _TREE_ISO_CHECK_H_</span><a name="l00024"></a>00024 <span class="preprocessor"></span><a name="l00025"></a>00025 <span class="preprocessor">#include <stack></span><a name="l00026"></a>00026 <span class="preprocessor">#include <utility></span><a name="l00027"></a>00027 <a name="l00028"></a>00028 <span class="preprocessor">#include "typedefs.h"</span><a name="l00029"></a>00029 <a name="l00030"></a>00030 <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">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,<a name="l00031"></a>00031 template<typename> class ALLOC><a name="l00032"></a>00032 class <a class="code" href="classpattern.html">pattern</a>;<a name="l00033"></a>00033 <a name="l00034"></a>00034 <span class="keyword">class </span>directed;<a name="l00035"></a>00035 <span class="keyword">class </span>acyclic;<a name="l00036"></a>00036 <span class="keyword">class </span>indegree_lte_one;<a name="l00037"></a>00037 <span class="keyword">class </span>ordered;<a name="l00038"></a>00038 <a name="l00039"></a>00039 <span class="keyword">template</span><<span class="keyword">class</span> prop, <span class="keyword">class</span> next_property><a name="l00040"></a>00040 <span class="keyword">class </span><a class="code" href="classproplist.html">proplist</a>;<a name="l00041"></a>00041 <a name="l00042"></a>00042 <span class="keyword">using namespace </span>std;<a name="l00043"></a>00043 <a name="l00045"></a>00045 <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="l00046"></a>00046 template <typename> class ALLOC ><a name="l00047"></a>00047 void update_rmost_path(<a class="code" href="classpattern.html">pattern</a><TREE_PROP, MP, ST, CC, ALLOC>*<span class="keyword">const</span>& cand_pat) {<a name="l00048"></a>00048 <a name="l00049"></a>00049 <span class="keyword">typedef</span> <a class="code" href="classpattern.html">pattern<TREE_PROP, MP, ST, CC, ALLOC></a> PATTERN;<a name="l00050"></a>00050 <a name="l00051"></a>00051 <span class="keywordtype">int</span> new_vid=cand_pat->rmost_vid(); <span class="comment">// vertex added to generate this candidate</span><a name="l00052"></a>00052 <span class="keyword">typename</span> PATTERN::RMP_T& rmost_path=cand_pat->_rmost_path;<a name="l00053"></a>00053 <span class="keywordtype">int</span> pvid=(cand_pat->in_edges(new_vid)).first->first; <span class="comment">// parent of new_vid</span><a name="l00054"></a>00054 <a name="l00055"></a>00055 <span class="comment">// pop off vids tills you hit pvid, or root of tree</span><a name="l00056"></a>00056 <span class="keyword">typename</span> PATTERN::RMP_T::iterator it=rmost_path.end()-1;<a name="l00057"></a>00057 <span class="keywordflow">if</span>(rmost_path.end()!=rmost_path.begin())<a name="l00058"></a>00058 <span class="keywordflow">while</span>(it!=rmost_path.begin()) {<a name="l00059"></a>00059 <span class="keywordflow">if</span>(*it==pvid)<a name="l00060"></a>00060 <span class="keywordflow">break</span>;<a name="l00061"></a>00061 it=rmost_path.erase(it);<a name="l00062"></a>00062 it--;<a name="l00063"></a>00063 <a name="l00064"></a>00064 <span class="comment">// update canonical code</span><a name="l00065"></a>00065 cand_pat->_canonical_code.backtrack();<a name="l00066"></a>00066 }<a name="l00067"></a>00067 <a name="l00068"></a>00068 rmost_path.push_back(new_vid);<a name="l00069"></a>00069 <span class="comment">// update canonical code</span><a name="l00070"></a>00070 cand_pat->_canonical_code.insert_vertex(cand_pat->label(new_vid));<a name="l00071"></a>00071 <a name="l00072"></a>00072 }<span class="comment">//end update_rmost_path()</span><a name="l00073"></a>00073 <a name="l00074"></a>00074 <a name="l00076"></a>00076 <span class="keyword">template</span><<span class="keyword">typename</span> IT><a name="l00077"></a>00077 <span class="keywordtype">int</span> eit_diff_one(IT it1, IT it2) {<a name="l00078"></a>00078 <span class="keywordflow">if</span>(it1==it2)<a name="l00079"></a>00079 <span class="keywordflow">return</span> <span class="keyword">true</span>;<a name="l00080"></a>00080 it1++;<a name="l00081"></a>00081 <span class="keywordflow">if</span>(it1==it2)<a name="l00082"></a>00082 <span class="keywordflow">return</span> <span class="keyword">true</span>;<a name="l00083"></a>00083 <a name="l00084"></a>00084 <span class="keywordflow">return</span> <span class="keyword">false</span>;<a name="l00085"></a>00085 }<a name="l00086"></a>00086 <a name="l00088"></a>00088 <span class="keyword">template</span><<span class="keyword">typename</span> IT><a name="l00089"></a>00089 IT last_eits(IT it1, IT it2) {<a name="l00090"></a>00090 IT prev=it1;<a name="l00091"></a>00091 it1++;<a name="l00092"></a>00092 it1++;<a name="l00093"></a>00093 <a name="l00094"></a>00094 <span class="keywordflow">while</span>(it1++!=it2)<a name="l00095"></a>00095 prev++;<a name="l00096"></a>00096 <a name="l00097"></a>00097 <span class="keywordflow">return</span> prev;<a name="l00098"></a>00098 }<a name="l00099"></a>00099 <a name="l00102"></a>00102 <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="l00103"></a>00103 template <typename> class ALLOC><a name="l00104"></a>00104 bool check_isomorphism(pattern<TREE_PROP, MP, ST, CC, ALLOC>*<span class="keyword">const</span>& cand_pat) {<a name="l00105"></a>00105 <a name="l00106"></a>00106 <span class="keyword">typedef</span> <a class="code" href="classpattern.html">pattern<TREE_PROP, MP, ST, CC, ALLOC></a> PATTERN;<a name="l00107"></a>00107 <a name="l00108"></a>00108 <span class="keyword">typename</span> PATTERN::RMP_T::const_iterator it;<a name="l00109"></a>00109 <span class="keyword">typename</span> PATTERN::CONST_EIT_PAIR eit_pair;<a name="l00110"></a>00110 <a name="l00111"></a>00111 update_rmost_path(cand_pat);<a name="l00112"></a>00112 it=cand_pat->_rmost_path.end();<a name="l00113"></a>00113 <span class="keywordflow">if</span>(cand_pat->_rmost_path.size())<a name="l00114"></a>00114 it--;<a name="l00115"></a>00115 <a name="l00116"></a>00116 <span class="keywordflow">while</span>(it>=cand_pat->_rmost_path.begin()) {<a name="l00117"></a>00117 <span class="comment">// get last 2 edges of *it</span><a name="l00118"></a>00118 eit_pair=cand_pat->out_edges(*it);⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -