📄 graph__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: graph_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>graph_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="l00025"></a>00025 <span class="preprocessor">#ifndef _GRAPH_ISO_CHECK_H</span><a name="l00026"></a>00026 <span class="preprocessor"></span><span class="preprocessor">#define _GRAPH_ISO_CHECK_H</span><a name="l00027"></a>00027 <span class="preprocessor"></span><a name="l00028"></a>00028 <span class="preprocessor">#include<vector></span><a name="l00029"></a>00029 <span class="preprocessor">#include<iostream></span><a name="l00030"></a>00030 <span class="preprocessor">#include "typedefs.h"</span><a name="l00031"></a>00031 <span class="preprocessor">#include "time_tracker.h"</span><a name="l00032"></a>00032 <a name="l00033"></a>00033 <span class="keyword">using namespace </span>std;<a name="l00034"></a>00034 <span class="preprocessor">#include "<a class="code" href="element__parser_8h.html">element_parser.h</a>"</span><a name="l00035"></a>00035 <a name="l00036"></a>00036 <span class="preprocessor">#define INF_LABEL "99999999" // max label initializer for edge & vertex labels</span><a name="l00037"></a>00037 <span class="preprocessor"></span><a name="l00038"></a>00038 <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="l00039"></a>00039 template <typename> class ALLOC ><a name="l00040"></a>00040 class <a class="code" href="classpattern.html">pattern</a>;<a name="l00041"></a>00041 <a name="l00042"></a>00042 <span class="keyword">class </span>undirected;<a name="l00043"></a>00043 <a name="l00044"></a>00044 <span class="keyword">template</span><<span class="keyword">class</span> prop, <span class="keyword">class</span> next_property><a name="l00045"></a>00045 <span class="keyword">class </span><a class="code" href="classproplist.html">proplist</a>;<a name="l00046"></a>00046 <a name="l00047"></a>00047 <a name="l00048"></a>00048 <span class="keywordtype">int</span> num_startup=0; <a name="l00049"></a>00049 <span class="keywordtype">int</span> num_urmp=0; <a name="l00050"></a>00050 <a class="code" href="classtime__tracker.html">time_tracker</a> tt_iso_chk;<a name="l00051"></a>00051 <a class="code" href="classtime__tracker.html">time_tracker</a> tt_iso_startup;<a name="l00052"></a>00052 <a class="code" href="classtime__tracker.html">time_tracker</a> tt_update_rmp;<a name="l00053"></a>00053 <a class="code" href="classtime__tracker.html">time_tracker</a> tt_minimal;<a name="l00054"></a>00054 <a class="code" href="classtime__tracker.html">time_tracker</a> tt_rest;<a name="l00055"></a>00055 <span class="keywordtype">void</span> print_rmp(<span class="keyword">const</span> vector<int>& rmp) {<a name="l00056"></a>00056 cout<<<span class="stringliteral">"rmp is:"</span><<endl;<a name="l00057"></a>00057 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0; i<rmp.size(); i++)<a name="l00058"></a>00058 cout<<rmp[i]<<<span class="stringliteral">" "</span>;<a name="l00059"></a>00059 cout<<endl;<a name="l00060"></a>00060 }<a name="l00061"></a>00061 <a name="l00064"></a>00064 <span class="comment">// Note: it is assumed that this function is called for graphs of atleast </span><a name="l00065"></a>00065 <span class="comment">// size=2</span><a name="l00066"></a>00066 <span class="keyword">template</span><<span class="keyword">class</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, <a name="l00067"></a>00067 template <typename> class ALLOC ><a name="l00068"></a>00068 void update_rmost_path(GRAPH_PATTERN*<span class="keyword">const</span>& cand_pat) {<a name="l00069"></a>00069 <span class="comment">// How it works: no change in rmost-path (rmp) if last edge added was back-</span><a name="l00070"></a>00070 <span class="comment">// edge - only append to canonical code. </span><a name="l00071"></a>00071 <span class="comment">// In case of fwd edge, rmp is modified as well</span><a name="l00072"></a>00072 <a name="l00073"></a>00073 num_urmp++; <a name="l00074"></a>00074 tt_update_rmp.<a class="code" href="classtime__tracker.html#cbe4e1e72cf61ff3f4c135e161fc5a50">start</a>();<a name="l00075"></a>00075 <a name="l00076"></a>00076 <span class="keywordtype">int</span> new_vid=cand_pat->rmost_vid(); <span class="comment">// vertex added to generate this candidate</span><a name="l00077"></a>00077 <span class="keyword">typename</span> GRAPH_PATTERN::RMP_T& rmost_path=cand_pat->_rmost_path;<a name="l00078"></a>00078 <a name="l00079"></a>00079 <span class="comment">// no change to rmp if this candidate was formed by back extension</span><a name="l00080"></a>00080 <span class="comment">// but canonical code must be updated</span><a name="l00081"></a>00081 <span class="keywordflow">if</span>(new_vid==*(rmost_path.end()-1)) {<a name="l00082"></a>00082 <span class="keyword">typename</span> GRAPH_PATTERN::CONST_EIT_PAIR eit_p=cand_pat->out_edges(new_vid);<a name="l00083"></a>00083 eit_p.second--;<a name="l00084"></a>00084 <span class="keywordtype">int</span> back_vid=eit_p.second->first; <span class="comment">// vid at back vertex of edge</span><a name="l00085"></a>00085 <span class="keyword">typename</span> GRAPH_PATTERN::CAN_CODE::FIVE_TUPLE new_tuple(new_vid, back_vid, cand_pat->label(new_vid), eit_p.second->second, cand_pat->label(back_vid));<a name="l00086"></a>00086 cand_pat->_canonical_code.push_back(new_tuple);<a name="l00087"></a>00087 <span class="keywordflow">return</span>;<a name="l00088"></a>00088 }<a name="l00089"></a>00089 <a name="l00091"></a>00091 <span class="keywordtype">int</span> pvid=(cand_pat->out_edges(new_vid)).first->first; <span class="comment">// parent of new_vid</span><a name="l00092"></a>00092 <span class="keyword">typename</span> GRAPH_PATTERN::RMP_T::iterator it=rmost_path.end()-1;<a name="l00093"></a>00093 <a name="l00094"></a>00094 <span class="keywordflow">while</span>(it!=rmost_path.begin()) {<a name="l00095"></a>00095 <span class="keywordflow">if</span>(*it==pvid)<a name="l00096"></a>00096 <span class="keywordflow">break</span>;<a name="l00097"></a>00097 it=rmost_path.erase(it);<a name="l00098"></a>00098 it--;<a name="l00099"></a>00099 }<a name="l00100"></a>00100 <a name="l00101"></a>00101 rmost_path.push_back(new_vid);<a name="l00102"></a>00102 <span class="comment">// update canonical code</span><a name="l00103"></a>00103 <span class="keyword">typename</span> GRAPH_PATTERN::CONST_EIT_PAIR eit_p=cand_pat->out_edges(new_vid);<a name="l00104"></a>00104 <span class="keyword">typename</span> GRAPH_PATTERN::CAN_CODE::FIVE_TUPLE new_tuple(pvid, new_vid, cand_pat->label(pvid), eit_p.first->second, cand_pat->label(new_vid));<a name="l00105"></a>00105 cand_pat->_canonical_code.push_back(new_tuple);<a name="l00106"></a>00106 tt_update_rmp.<a class="code" href="classtime__tracker.html#a6790d26a9c1c83569711a7634413856">stop</a>();<a name="l00107"></a>00107 <a name="l00108"></a>00108 }<span class="comment">//end update_rmost_path()</span><a name="l00109"></a>00109 <a name="l00112"></a>00112 <span class="keyword">template</span><<span class="keyword">class</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,<a name="l00113"></a>00113 template <typename> class ALLOC ><a name="l00114"></a>00114 bool check_isomorphism(GRAPH_PATTERN*<span class="keyword">const</span>& cand_pat) {<a name="l00115"></a>00115 <span class="comment">// How it works: it is a recursive test. At each recursive call, the </span><a name="l00116"></a>00116 <span class="comment">// minimal edge according to DFS ordering (gSpan) is determined. If this </span><a name="l00117"></a>00117 <span class="comment">// minimal edge is what cand_pat has at that level, then cand_pat passes </span><a name="l00118"></a>00118 <span class="comment">// test at that call and further recursive calls have to be made. This </span><a name="l00119"></a>00119 <span class="comment">// recursion continues till i) test failed at some level or ii) all edges </span><a name="l00120"></a>00120 <span class="comment">// are exhausted, when cand_pat is declared to have passes isomorphsim test</span><a name="l00121"></a>00121 <a name="l00122"></a>00122 tt_iso_chk.<a class="code" href="classtime__tracker.html#cbe4e1e72cf61ff3f4c135e161fc5a50">start</a>();<a name="l00123"></a>00123 <a name="l00124"></a>00124 <span class="keyword">typedef</span> CC<GRAPH_PROP, typename GRAPH_PATTERN::VERTEX_T, typename GRAPH_PATTERN::EDGE_T, ALLOC > CAN_CODE;<a name="l00125"></a>00125 <a name="l00126"></a>00126 <span class="comment">// first step is get rmp updated</span><a name="l00127"></a>00127 update_rmost_path(cand_pat);<a name="l00128"></a>00128 <a name="l00129"></a>00129 <span class="preprocessor">#ifdef PRINT</span><a name="l00130"></a>00130 <span class="preprocessor"></span> cout<<<span class="stringliteral">"checking isomorphism for: "</span><<endl<<cand_pat->canonical_code()<<endl;<a name="l00131"></a>00131 <span class="preprocessor">#endif</span><a name="l00132"></a>00132 <span class="preprocessor"></span><a name="l00133"></a>00133 <span class="keyword">typename</span> GRAPH_PATTERN::EDGE_T e; <span class="comment">// least label of edge</span><a name="l00134"></a>00134 <span class="keyword">typename</span> GRAPH_PATTERN::VERTEX_T src_v, dest_v; <span class="comment">// least labelled vertices of an edge</span><a name="l00135"></a>00135 vector<pair<int, int> > ids; <span class="comment">// ids with least labelled edges</span><a name="l00136"></a>00136 vector<CAN_CODE> new_codes;<a name="l00137"></a>00137 <a name="l00138"></a>00138 tt_rest.<a class="code" href="classtime__tracker.html#cbe4e1e72cf61ff3f4c135e161fc5a50">start</a>();<a name="l00139"></a>00139 <span class="comment">// default startup values</span><a name="l00140"></a>00140 src_v=cand_pat->label(0);<a name="l00141"></a>00141 dest_v=cand_pat->label(1);<a name="l00142"></a>00142 <span class="keywordflow">if</span>(!cand_pat->get_out_edge(0, 1, e)) {<a name="l00143"></a>00143 cerr<<<span class="stringliteral">"check_iso(graph): get_out_edge failed in startup"</span><<endl;<a name="l00144"></a>00144 tt_iso_chk.<a class="code" href="classtime__tracker.html#a6790d26a9c1c83569711a7634413856">stop</a>();<a name="l00145"></a>00145 <span class="keywordflow">return</span> <span class="keyword">false</span>;<a name="l00146"></a>00146 }<a name="l00147"></a>00147 tt_rest.<a class="code" href="classtime__tracker.html#a6790d26a9c1c83569711a7634413856">stop</a>();<a name="l00148"></a>00148 <a name="l00149"></a>00149 iso_startup(cand_pat, src_v, dest_v, e, ids);⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -