📄 graph__can__code_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_can_code.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_can_code.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="preprocessor">#ifndef _GRAPH_CAN_CODE_H</span><a name="l00021"></a>00021 <span class="preprocessor"></span><span class="preprocessor">#define _GRAPH_CAN_CODE_H</span><a name="l00022"></a>00022 <span class="preprocessor"></span><a name="l00023"></a>00023 <span class="keyword">using namespace </span>std;<a name="l00024"></a>00024 <a name="l00025"></a>00025 <span class="preprocessor">#include <string></span><a name="l00026"></a>00026 <span class="preprocessor">#include <sstream></span><a name="l00027"></a>00027 <span class="preprocessor">#include <vector></span><a name="l00028"></a>00028 <span class="preprocessor">#include <ext/hash_map></span><a name="l00029"></a>00029 <span class="preprocessor">#include "generic_classes.h"</span><a name="l00030"></a>00030 <a name="l00031"></a>00031 <a name="l00032"></a>00032 <a class="code" href="classtime__tracker.html">time_tracker</a> tt_iostream;<a name="l00033"></a>00033 <a name="l00034"></a>00034 <span class="keyword">template</span><<span class="keyword">typename</span> V_T, <span class="keyword">typename</span> E_T><a name="l00035"></a>00035 <span class="keyword">struct </span><a class="code" href="structfive__tuple.html">five_tuple</a>;<a name="l00036"></a>00036 <a name="l00037"></a>00037 <span class="keyword">template</span><<span class="keyword">typename</span> V_T, <span class="keyword">typename</span> E_T><a name="l00038"></a>00038 ostream& operator<< (ostream&, const five_tuple<V_T, E_T>&);<a name="l00039"></a>00039 <a name="l00040"></a>00040 <span class="comment">// NOTE: should the labels (_li, _lij, _lj) in thus struct be stored as </span><a name="l00041"></a>00041 <span class="comment">// references (to avoid copying them) ?? Will that work ??</span><a name="l00042"></a>00042 <a name="l00049"></a>00049 <span class="keyword">template</span><<span class="keyword">typename</span> V_T, <span class="keyword">typename</span> E_T><a name="l00050"></a><a class="code" href="structfive__tuple.html">00050</a> <span class="keyword">struct </span><a class="code" href="structfive__tuple.html">five_tuple</a><a name="l00051"></a>00051 {<a name="l00052"></a>00052 <a class="code" href="structfive__tuple.html">five_tuple</a>() {}<a name="l00053"></a>00053 <a name="l00054"></a>00054 <a class="code" href="structfive__tuple.html">five_tuple</a>(<span class="keyword">const</span> <span class="keywordtype">int</span>& id1, <span class="keyword">const</span> <span class="keywordtype">int</span>& id2, <span class="keyword">const</span> V_T& li, <span class="keyword">const</span> E_T& lij, <span class="keyword">const</span> V_T& lj): _i(id1), _j(id2), _li(li), _lj(lj), _lij(lij) {}<a name="l00055"></a>00055 <a name="l00056"></a>00056 <span class="keywordtype">bool</span> operator< (const five_tuple<V_T, E_T>& rhs) <span class="keyword">const</span> {<a name="l00057"></a>00057 <span class="comment">// follows ordering given on pg 10 of gSpan TR</span><a name="l00058"></a>00058 <span class="keywordtype">bool</span> is_fwd=(_i<_j);<a name="l00059"></a>00059 <span class="keywordtype">bool</span> rhs_is_fwd=(rhs._i<rhs._j);<a name="l00060"></a>00060 <a name="l00061"></a>00061 <span class="keywordflow">if</span>(!is_fwd && rhs_is_fwd)<a name="l00062"></a>00062 <span class="keywordflow">return</span> <span class="keyword">true</span>;<a name="l00063"></a>00063 <a name="l00064"></a>00064 <span class="keywordflow">if</span>(!is_fwd && !rhs_is_fwd && _j<rhs._j)<a name="l00065"></a>00065 <span class="keywordflow">return</span> <span class="keyword">true</span>;<a name="l00066"></a>00066 <a name="l00067"></a>00067 <span class="keywordflow">if</span>(!is_fwd && !rhs_is_fwd && _j==rhs._j && _lij<rhs._lij)<a name="l00068"></a>00068 <span class="keywordflow">return</span> <span class="keyword">true</span>;<a name="l00069"></a>00069 <a name="l00070"></a>00070 <span class="keywordflow">if</span>(is_fwd && rhs_is_fwd && _i>rhs._i)<a name="l00071"></a>00071 <span class="keywordflow">return</span> <span class="keyword">true</span>;<a name="l00072"></a>00072 <a name="l00073"></a>00073 <span class="keywordflow">if</span>(is_fwd && rhs_is_fwd && _i==rhs._i && _li<rhs._li)<a name="l00074"></a>00074 <span class="keywordflow">return</span> <span class="keyword">true</span>;<a name="l00075"></a>00075 <a name="l00076"></a>00076 <span class="keywordflow">if</span>(is_fwd && rhs_is_fwd && _i==rhs._i && _li==rhs._li && _lij<rhs._lij)<a name="l00077"></a>00077 <span class="keywordflow">return</span> <span class="keyword">true</span>;<a name="l00078"></a>00078 <a name="l00079"></a>00079 <span class="keywordflow">if</span>(is_fwd && rhs_is_fwd && _i==rhs._i && _li==rhs._li && _lij==rhs._lij && _lj<rhs._lj)<a name="l00080"></a>00080 <span class="keywordflow">return</span> <span class="keyword">true</span>;<a name="l00081"></a>00081 <a name="l00082"></a>00082 <span class="keywordflow">return</span> <span class="keyword">false</span>;<a name="l00083"></a>00083 }<span class="comment">//end operator<</span><a name="l00084"></a>00084 <a name="l00085"></a>00085 <span class="keyword">friend</span> ostream& operator<< <>(ostream&, <span class="keyword">const</span> <a class="code" href="structfive__tuple.html">five_tuple<V_T, E_T></a>&);<a name="l00086"></a>00086 <a name="l00087"></a>00087 <span class="keywordtype">int</span> _i;<a name="l00088"></a>00088 <span class="keywordtype">int</span> _j;<a name="l00089"></a>00089 V_T _li;<a name="l00090"></a>00090 V_T _lj;<a name="l00091"></a>00091 E_T _lij;<a name="l00092"></a>00092 <a name="l00093"></a>00093 };<span class="comment">//end struct five_tuple</span><a name="l00094"></a>00094 <a name="l00095"></a>00095 <a name="l00096"></a>00096 <span class="keyword">template</span><<span class="keyword">typename</span> V_T, <span class="keyword">typename</span> E_T><a name="l00097"></a>00097 ostream& operator<< (ostream& ostr, const five_tuple<V_T, E_T>& tuple) {<a name="l00098"></a>00098 ostr<<tuple._i<<<span class="stringliteral">" "</span><<tuple._j<<<span class="stringliteral">" "</span><<tuple._li<<<span class="stringliteral">" "</span><<tuple._lij<<<span class="stringliteral">" "</span><<tuple._lj;<a name="l00099"></a>00099 <span class="keywordflow">return</span> ostr;<a name="l00100"></a>00100 }<a name="l00101"></a>00101 <a name="l00102"></a>00102 <span class="keyword">template</span><<span class="keyword">typename</span> PP, <span class="keyword">typename</span> V_T, <span class="keyword">typename</span> E_T, <span class="keyword">template</span> <<span class="keyword">typename</span>> <span class="keyword">class </span>ALLOC ><a name="l00103"></a>00103 <span class="keyword">class </span><a class="code" href="classcanonical__code.html">canonical_code</a><GRAPH_PROP, V_T, E_T, ALLOC >;<a name="l00104"></a>00104 <a name="l00105"></a>00105 <span class="keyword">template</span><<span class="keyword">typename</span> PP, <span class="keyword">typename</span> V_T, <span class="keyword">typename</span> E_T, <span class="keyword">template</span> <<span class="keyword">typename</span>> <span class="keyword">class </span>ALLOC ><a name="l00106"></a>00106 ostream& operator<< (ostream&, const canonical_code<GRAPH_PROP, V_T, E_T, ALLOC >&);<a name="l00107"></a>00107 <a name="l00108"></a>00108 <a name="l00115"></a>00115 <span class="keyword">template</span><<span class="keyword">typename</span> PP, <span class="keyword">typename</span> V_T, <span class="keyword">typename</span> E_T, <span class="keyword">template</span> <<span class="keyword">typename</span>> <span class="keyword">class </span>ALLOC=std::allocator ><a name="l00116"></a><a class="code" href="classcanonical__code_3_01GRAPH__PROP_00_01V__T_00_01E__T_00_01ALLOC_01_4.html">00116</a> <span class="keyword">class </span><a class="code" href="classcanonical__code.html">canonical_code</a><GRAPH_PROP, V_T, E_T, ALLOC ><a name="l00117"></a>00117 {<a name="l00118"></a>00118 <span class="keyword">public</span>:<a name="l00119"></a>00119 <a name="l00120"></a>00120 <span class="keyword">typedef</span> <span class="keywordtype">int</span> STORAGE_TYPE;<a name="l00121"></a>00121 <span class="keyword">typedef</span> <a class="code" href="structfive__tuple.html">five_tuple<V_T, E_T></a> <a class="code" href="structfive__tuple.html">FIVE_TUPLE</a>;<a name="l00122"></a>00122 <span class="keyword">typedef</span> <a class="code" href="structfive__tuple.html">FIVE_TUPLE</a> <a class="code" href="structfive__tuple.html">INIT_TYPE</a>;<a name="l00123"></a>00123 <span class="keyword">typedef</span> <a class="code" href="structeqint.html">eqint</a> <a class="code" href="structeqint.html">COMPARISON_FUNC</a>;<a name="l00124"></a>00124 <a name="l00125"></a>00125 <span class="keyword">typedef</span> vector<FIVE_TUPLE, ALLOC<FIVE_TUPLE> > TUPLES;<a name="l00126"></a>00126 <span class="keyword">typedef</span> <span class="keyword">typename</span> TUPLES::const_iterator CONST_IT;<a name="l00127"></a>00127 <span class="keyword">typedef</span> <span class="keyword">typename</span> TUPLES::iterator IT;<a name="l00128"></a>00128 <span class="keyword">typedef</span> <a class="code" href="classcanonical__code.html">canonical_code<GRAPH_PROP, V_T, E_T, ALLOC ></a> <a class="code" href="classcanonical__code_3_01GRAPH__PROP_00_01V__T_00_01E__T_00_01ALLOC_01_4.html">CAN_CODE</a>;<a name="l00129"></a>00129 <span class="keyword">typedef</span> HASHNS::hash_map<int, int, HASHNS::hash<int>, std::equal_to<int>, ALLOC<int> > VID_HMAP;<a name="l00130"></a>00130 <span class="keyword">typedef</span> <span class="keyword">typename</span> VID_HMAP::const_iterator VM_CONST_IT;<a name="l00131"></a>00131 <span class="keyword">typedef</span> vector<int, ALLOC<int> > RMP_T;<a name="l00132"></a>00132 <a name="l00133"></a>00133 <a class="code" href="classcanonical__code.html">canonical_code</a>() : _can_code(id_generator++) {} <span class="comment">// defunct default constructor</span><a name="l00134"></a>00134 <a name="l00137"></a><a class="code" href="classcanonical__code_3_01GRAPH__PROP_00_01V__T_00_01E__T_00_01ALLOC_01_4.html#7b8401cc684faa17f6aaf33dae46d614">00137</a> <a class="code" href="classcanonical__code.html">canonical_code</a>(<span class="keyword">const</span> <a class="code" href="structfive__tuple.html">FIVE_TUPLE</a>& ft, <span class="keyword">const</span> <span class="keywordtype">int</span>&gi, <span class="keyword">const</span> <span class="keywordtype">int</span>& gj) {<a name="l00138"></a>00138 append(ft, gi, gj);<a name="l00139"></a>00139 }<a name="l00140"></a>00140 <a name="l00141"></a>00141 IT begin() { <span class="keywordflow">return</span> _dfs_code.begin();}<a name="l00142"></a>00142 CONST_IT begin()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> _dfs_code.begin();}<a name="l00143"></a>00143 IT end() { <span class="keywordflow">return</span> _dfs_code.end();}<a name="l00144"></a>00144 CONST_IT end()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> _dfs_code.end();}<a name="l00145"></a>00145 <a name="l00146"></a>00146 <span class="keywordtype">int</span> size()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> _dfs_code.size();}<a name="l00147"></a>00147 <a name="l00148"></a>00148 <span class="keywordtype">void</span> clear() {<a name="l00149"></a>00149 _dfs_code.clear();<a name="l00150"></a>00150 _cid_to_gid.clear();<a name="l00151"></a>00151 _gid_to_cid.clear();<a name="l00152"></a>00152 _rmp.clear();<a name="l00153"></a>00153 }<a name="l00154"></a>00154 <a name="l00155"></a>00155 <span class="keyword">const</span> FIVE_TUPLE& operator[](<span class="keyword">const</span> <span class="keywordtype">int</span>& index)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> _dfs_code[index];}⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -