Sophie

Sophie

distrib > Mageia > 4 > i586 > media > core-release > by-pkgid > 2a90dcd9dfcd284ddf6dc3b0a0b0bf47 > files > 99

steghide-0.5.1-17.mga4.i586.rpm

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.5"/>
<title>steghide: DFSAPHeuristic.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">steghide
   &#160;<span id="projectnumber">0.5.1</span>
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.5 -->
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="headertitle">
<div class="title">DFSAPHeuristic.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="DFSAPHeuristic_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> * steghide 0.5.1 - a steganography program</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> * Copyright (C) 1999-2003 Stefan Hetzl &lt;shetzl@chello.at&gt;</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment"> * This program is free software; you can redistribute it and/or</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment"> * modify it under the terms of the GNU General Public License</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment"> * as published by the Free Software Foundation; either version 2</span></div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment"> * of the License, or (at your option) any later version.</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment"> * This program is distributed in the hope that it will be useful,</span></div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment"> * GNU General Public License for more details.</span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment"> * You should have received a copy of the GNU General Public License</span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment"> * along with this program; if not, write to the Free Software</span></div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment"> * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.</span></div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;</div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#ifndef SH_DFSAPHEURISTIC</span></div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define SH_DFSAPHEURISTIC</span></div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="EdgeIterator_8h.html">EdgeIterator.h</a>&quot;</span></div>
<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="MatchingAlgorithm_8h.html">MatchingAlgorithm.h</a>&quot;</span></div>
<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="Vertex_8h.html">Vertex.h</a>&quot;</span></div>
<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;</div>
<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="keyword">class </span><a class="code" href="classEdge.html">Edge</a> ;</div>
<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="Graph_8h.html">Graph.h</a>&quot;</span></div>
<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="keyword">class </span><a class="code" href="classMatching.html">Matching</a> ;</div>
<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;</div>
<div class="line"><a name="l00040"></a><span class="lineno"><a class="line" href="classDFSAPHeuristic.html">   40</a></span>&#160;<span class="keyword">class </span><a class="code" href="classDFSAPHeuristic.html">DFSAPHeuristic</a> : <span class="keyword">public</span> <a class="code" href="classMatchingAlgorithm.html">MatchingAlgorithm</a> {</div>
<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;        <span class="keyword">public</span>:</div>
<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;        <a class="code" href="classDFSAPHeuristic.html#ab0d70281dd13170430076bb6bf7e6d9d">DFSAPHeuristic</a> (<a class="code" href="classGraph.html">Graph</a>* g, <a class="code" href="classMatching.html">Matching</a>* m, <span class="keywordtype">float</span> goal = 100.0, <a class="code" href="common_8h.html#a6b8592979b076e06aa233e3f586ac999">UWORD32</a> mne = <a class="code" href="common_8h.html#a7c5e1100effed542218f9eff1db76b6a">UWORD32_MAX</a>, <a class="code" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06f">EdgeIterator::ITERATIONMODE</a> mo = <a class="code" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06fa6406f55724d4783ed9a29dc26ffbafc6">EdgeIterator::SAMPLEOCCURENCE</a>) ;</div>
<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;</div>
<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classDFSAPHeuristic.html#a995ea2e59f6b27143da1efa3799c68f4">~DFSAPHeuristic</a> (<span class="keywordtype">void</span>) ;</div>
<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;</div>
<div class="line"><a name="l00054"></a><span class="lineno"><a class="line" href="classDFSAPHeuristic.html#a8ee345a8b89cbc8cf4f4ef7d8305ff6d">   54</a></span>&#160;        <span class="keyword">const</span> <span class="keywordtype">char</span>* <a class="code" href="classDFSAPHeuristic.html#a8ee345a8b89cbc8cf4f4ef7d8305ff6d">getName</a> (<span class="keywordtype">void</span>)<span class="keyword"> const</span></div>
<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;<span class="keyword">                </span>{ <span class="keywordflow">return</span> <span class="stringliteral">&quot;DFS Augmenting Path Heuristic&quot;</span> ; } ;</div>
<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;</div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;        <span class="keywordtype">void</span> <a class="code" href="classDFSAPHeuristic.html#aa32cf73dfea46c56170ab93d038aa1bb">reset</a> (<a class="code" href="common_8h.html#a6b8592979b076e06aa233e3f586ac999">UWORD32</a> mne = <a class="code" href="common_8h.html#a7c5e1100effed542218f9eff1db76b6a">UWORD32_MAX</a>, <a class="code" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06f">EdgeIterator::ITERATIONMODE</a> mo = <a class="code" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06fa6406f55724d4783ed9a29dc26ffbafc6">EdgeIterator::SAMPLEOCCURENCE</a>) ;</div>
<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;</div>
<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;        <span class="keywordtype">void</span> <a class="code" href="classDFSAPHeuristic.html#a6be8de5d724975d145500fc7a1f12198">run</a> (<span class="keywordtype">void</span>) ;</div>
<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;</div>
<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;        <span class="keyword">private</span>:</div>
<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;        <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <a class="code" href="classDFSAPHeuristic.html#a2046bacf3bdd3468cd5732bb7544a090">searchAugmentingPath</a> (<a class="code" href="classVertex.html">Vertex</a>* v0, <span class="keyword">const</span> <a class="code" href="classEdge.html">Edge</a>** path) ;</div>
<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;</div>
<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;        <span class="keyword">const</span> <a class="code" href="classEdge.html">Edge</a>* <a class="code" href="classDFSAPHeuristic.html#a8fbae63f1ab832aacf5c432e1270589e">getNextEdge</a> (<a class="code" href="classVertex.html">Vertex</a> *v) ;</div>
<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;</div>
<div class="line"><a name="l00075"></a><span class="lineno"><a class="line" href="classDFSAPHeuristic.html#a88358a5e013978a2211d6cc94cbc19e8">   75</a></span>&#160;        <span class="keywordtype">void</span> <a class="code" href="classDFSAPHeuristic.html#a88358a5e013978a2211d6cc94cbc19e8">markVisited</a> (<a class="code" href="classVertex.html">Vertex</a> *v)</div>
<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;                { <a class="code" href="classDFSAPHeuristic.html#aef8179c11e9f17f0499281ff4ea04a57">TimeCounters</a>[v-&gt;<a class="code" href="classVertex.html#ad1473af6f3e4d28c15d1f28a560717ea">getLabel</a>()] = <a class="code" href="classDFSAPHeuristic.html#a58332cda0fbc79a94ff15b2715cdb59e">TimeCounter</a> ; } ;</div>
<div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;</div>
<div class="line"><a name="l00082"></a><span class="lineno"><a class="line" href="classDFSAPHeuristic.html#a64e8f25fe3d703673d4e32531eb53ff0">   82</a></span>&#160;        <span class="keywordtype">bool</span> <a class="code" href="classDFSAPHeuristic.html#a64e8f25fe3d703673d4e32531eb53ff0">isVisited</a> (<a class="code" href="classVertex.html">Vertex</a> *v)<span class="keyword"> const</span></div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;<span class="keyword">                </span>{ <span class="keywordflow">return</span> <a class="code" href="classDFSAPHeuristic.html#a64e8f25fe3d703673d4e32531eb53ff0">isVisited</a>(v-&gt;<a class="code" href="classVertex.html#ad1473af6f3e4d28c15d1f28a560717ea">getLabel</a>()) ; } ;</div>
<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;</div>
<div class="line"><a name="l00085"></a><span class="lineno"><a class="line" href="classDFSAPHeuristic.html#a43559467d5f822ecaf739b215bb64441">   85</a></span>&#160;        <span class="keywordtype">bool</span> <a class="code" href="classDFSAPHeuristic.html#a43559467d5f822ecaf739b215bb64441">isVisited</a> (<a class="code" href="common_8h.html#ab9c88dfaf90b738f73f1700aa77d06ef">VertexLabel</a> vlbl)<span class="keyword"> const</span></div>
<div class="line"><a name="l00086"></a><span class="lineno"><a class="line" href="classDFSAPHeuristic.html#a58332cda0fbc79a94ff15b2715cdb59e">   86</a></span>&#160;<span class="keyword">                </span>{ <span class="keywordflow">return</span> (<a class="code" href="classDFSAPHeuristic.html#aef8179c11e9f17f0499281ff4ea04a57">TimeCounters</a>[vlbl] == <a class="code" href="classDFSAPHeuristic.html#a58332cda0fbc79a94ff15b2715cdb59e">TimeCounter</a>) ; } ;</div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;</div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;        <a class="code" href="common_8h.html#a6b8592979b076e06aa233e3f586ac999">UWORD32</a> <a class="code" href="classDFSAPHeuristic.html#a58332cda0fbc79a94ff15b2715cdb59e">TimeCounter</a> ;</div>
<div class="line"><a name="l00089"></a><span class="lineno"><a class="line" href="classDFSAPHeuristic.html#aef8179c11e9f17f0499281ff4ea04a57">   89</a></span>&#160;        <a class="code" href="common_8h.html#a6b8592979b076e06aa233e3f586ac999">UWORD32</a>* <a class="code" href="classDFSAPHeuristic.html#aef8179c11e9f17f0499281ff4ea04a57">TimeCounters</a> ;</div>
<div class="line"><a name="l00090"></a><span class="lineno"><a class="line" href="classDFSAPHeuristic.html#a25fe18d2559609eab338ab4c2fffd9fc">   90</a></span>&#160;        <span class="keywordtype">bool</span>* <a class="code" href="classDFSAPHeuristic.html#a25fe18d2559609eab338ab4c2fffd9fc">VertexOnPath</a> ;</div>
<div class="line"><a name="l00091"></a><span class="lineno"><a class="line" href="classDFSAPHeuristic.html#aa31f7a99d7771193e274d962c2841a2c">   91</a></span>&#160;        <a class="code" href="classEdgeIterator.html">EdgeIterator</a>* <a class="code" href="classDFSAPHeuristic.html#aa31f7a99d7771193e274d962c2841a2c">EdgeIterators</a> ;</div>
<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;</div>
<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;<span class="preprocessor">#ifdef DEBUG</span></div>
<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;<span class="preprocessor"></span>        <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <span class="keywordtype">long</span> NEdgesSuccessful ;</div>
<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;        <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <span class="keywordtype">long</span> NEdgesUnsuccessful ;</div>
<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;        <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> NSuccessful ;</div>
<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;        <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> NUnsuccessful ;</div>
<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;        std::string SuccessString ;</div>
<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;<span class="preprocessor"></span>} ;</div>
<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;</div>
<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;<span class="preprocessor">#endif // ndef SH_DFSAPHEURISTIC</span></div>
<div class="ttc" id="classVertex_html_ad1473af6f3e4d28c15d1f28a560717ea"><div class="ttname"><a href="classVertex.html#ad1473af6f3e4d28c15d1f28a560717ea">Vertex::getLabel</a></div><div class="ttdeci">VertexLabel getLabel(void) const </div><div class="ttdef"><b>Definition:</b> Vertex.h:98</div></div>
<div class="ttc" id="classEdgeIterator_html_a1e6b8b43d1620445bf945f667a38f06f"><div class="ttname"><a href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06f">EdgeIterator::ITERATIONMODE</a></div><div class="ttdeci">ITERATIONMODE</div><div class="ttdef"><b>Definition:</b> EdgeIterator.h:53</div></div>
<div class="ttc" id="MatchingAlgorithm_8h_html"><div class="ttname"><a href="MatchingAlgorithm_8h.html">MatchingAlgorithm.h</a></div></div>
<div class="ttc" id="classEdgeIterator_html_a1e6b8b43d1620445bf945f667a38f06fa6406f55724d4783ed9a29dc26ffbafc6"><div class="ttname"><a href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06fa6406f55724d4783ed9a29dc26ffbafc6">EdgeIterator::SAMPLEOCCURENCE</a></div><div class="ttdef"><b>Definition:</b> EdgeIterator.h:54</div></div>
<div class="ttc" id="classGraph_html"><div class="ttname"><a href="classGraph.html">Graph</a></div><div class="ttdoc">a graph constructed from a cover file and a message to be embedded </div><div class="ttdef"><b>Definition:</b> Graph.h:51</div></div>
<div class="ttc" id="classDFSAPHeuristic_html_aa32cf73dfea46c56170ab93d038aa1bb"><div class="ttname"><a href="classDFSAPHeuristic.html#aa32cf73dfea46c56170ab93d038aa1bb">DFSAPHeuristic::reset</a></div><div class="ttdeci">void reset(UWORD32 mne=UWORD32_MAX, EdgeIterator::ITERATIONMODE mo=EdgeIterator::SAMPLEOCCURENCE)</div><div class="ttdef"><b>Definition:</b> DFSAPHeuristic.cc:61</div></div>
<div class="ttc" id="classDFSAPHeuristic_html_a2046bacf3bdd3468cd5732bb7544a090"><div class="ttname"><a href="classDFSAPHeuristic.html#a2046bacf3bdd3468cd5732bb7544a090">DFSAPHeuristic::searchAugmentingPath</a></div><div class="ttdeci">unsigned long searchAugmentingPath(Vertex *v0, const Edge **path)</div><div class="ttdef"><b>Definition:</b> DFSAPHeuristic.cc:125</div></div>
<div class="ttc" id="classEdge_html"><div class="ttname"><a href="classEdge.html">Edge</a></div><div class="ttdef"><b>Definition:</b> Edge.h:28</div></div>
<div class="ttc" id="classDFSAPHeuristic_html_a8ee345a8b89cbc8cf4f4ef7d8305ff6d"><div class="ttname"><a href="classDFSAPHeuristic.html#a8ee345a8b89cbc8cf4f4ef7d8305ff6d">DFSAPHeuristic::getName</a></div><div class="ttdeci">const char * getName(void) const </div><div class="ttdef"><b>Definition:</b> DFSAPHeuristic.h:54</div></div>
<div class="ttc" id="classDFSAPHeuristic_html_ab0d70281dd13170430076bb6bf7e6d9d"><div class="ttname"><a href="classDFSAPHeuristic.html#ab0d70281dd13170430076bb6bf7e6d9d">DFSAPHeuristic::DFSAPHeuristic</a></div><div class="ttdeci">DFSAPHeuristic(Graph *g, Matching *m, float goal=100.0, UWORD32 mne=UWORD32_MAX, EdgeIterator::ITERATIONMODE mo=EdgeIterator::SAMPLEOCCURENCE)</div><div class="ttdef"><b>Definition:</b> DFSAPHeuristic.cc:28</div></div>
<div class="ttc" id="classDFSAPHeuristic_html_a43559467d5f822ecaf739b215bb64441"><div class="ttname"><a href="classDFSAPHeuristic.html#a43559467d5f822ecaf739b215bb64441">DFSAPHeuristic::isVisited</a></div><div class="ttdeci">bool isVisited(VertexLabel vlbl) const </div><div class="ttdef"><b>Definition:</b> DFSAPHeuristic.h:85</div></div>
<div class="ttc" id="common_8h_html_a7c5e1100effed542218f9eff1db76b6a"><div class="ttname"><a href="common_8h.html#a7c5e1100effed542218f9eff1db76b6a">UWORD32_MAX</a></div><div class="ttdeci">#define UWORD32_MAX</div><div class="ttdef"><b>Definition:</b> common.h:53</div></div>
<div class="ttc" id="common_8h_html_ab9c88dfaf90b738f73f1700aa77d06ef"><div class="ttname"><a href="common_8h.html#ab9c88dfaf90b738f73f1700aa77d06ef">VertexLabel</a></div><div class="ttdeci">UWORD32 VertexLabel</div><div class="ttdef"><b>Definition:</b> common.h:68</div></div>
<div class="ttc" id="EdgeIterator_8h_html"><div class="ttname"><a href="EdgeIterator_8h.html">EdgeIterator.h</a></div></div>
<div class="ttc" id="classDFSAPHeuristic_html_a25fe18d2559609eab338ab4c2fffd9fc"><div class="ttname"><a href="classDFSAPHeuristic.html#a25fe18d2559609eab338ab4c2fffd9fc">DFSAPHeuristic::VertexOnPath</a></div><div class="ttdeci">bool * VertexOnPath</div><div class="ttdef"><b>Definition:</b> DFSAPHeuristic.h:90</div></div>
<div class="ttc" id="common_8h_html_a6b8592979b076e06aa233e3f586ac999"><div class="ttname"><a href="common_8h.html#a6b8592979b076e06aa233e3f586ac999">UWORD32</a></div><div class="ttdeci">unsigned long UWORD32</div><div class="ttdef"><b>Definition:</b> common.h:45</div></div>
<div class="ttc" id="classMatching_html"><div class="ttname"><a href="classMatching.html">Matching</a></div><div class="ttdoc">represent a matching on a graph </div><div class="ttdef"><b>Definition:</b> Matching.h:41</div></div>
<div class="ttc" id="Vertex_8h_html"><div class="ttname"><a href="Vertex_8h.html">Vertex.h</a></div></div>
<div class="ttc" id="classDFSAPHeuristic_html_aa31f7a99d7771193e274d962c2841a2c"><div class="ttname"><a href="classDFSAPHeuristic.html#aa31f7a99d7771193e274d962c2841a2c">DFSAPHeuristic::EdgeIterators</a></div><div class="ttdeci">EdgeIterator * EdgeIterators</div><div class="ttdef"><b>Definition:</b> DFSAPHeuristic.h:91</div></div>
<div class="ttc" id="classDFSAPHeuristic_html_aef8179c11e9f17f0499281ff4ea04a57"><div class="ttname"><a href="classDFSAPHeuristic.html#aef8179c11e9f17f0499281ff4ea04a57">DFSAPHeuristic::TimeCounters</a></div><div class="ttdeci">UWORD32 * TimeCounters</div><div class="ttdef"><b>Definition:</b> DFSAPHeuristic.h:89</div></div>
<div class="ttc" id="classEdgeIterator_html"><div class="ttname"><a href="classEdgeIterator.html">EdgeIterator</a></div><div class="ttdoc">allows an iteration trough all edges of a vertex </div><div class="ttdef"><b>Definition:</b> EdgeIterator.h:51</div></div>
<div class="ttc" id="classDFSAPHeuristic_html_a995ea2e59f6b27143da1efa3799c68f4"><div class="ttname"><a href="classDFSAPHeuristic.html#a995ea2e59f6b27143da1efa3799c68f4">DFSAPHeuristic::~DFSAPHeuristic</a></div><div class="ttdeci">virtual ~DFSAPHeuristic(void)</div><div class="ttdef"><b>Definition:</b> DFSAPHeuristic.cc:54</div></div>
<div class="ttc" id="classDFSAPHeuristic_html"><div class="ttname"><a href="classDFSAPHeuristic.html">DFSAPHeuristic</a></div><div class="ttdoc">a matching algorithm implementing a heuristic search for augmenting paths </div><div class="ttdef"><b>Definition:</b> DFSAPHeuristic.h:40</div></div>
<div class="ttc" id="Graph_8h_html"><div class="ttname"><a href="Graph_8h.html">Graph.h</a></div></div>
<div class="ttc" id="classDFSAPHeuristic_html_a88358a5e013978a2211d6cc94cbc19e8"><div class="ttname"><a href="classDFSAPHeuristic.html#a88358a5e013978a2211d6cc94cbc19e8">DFSAPHeuristic::markVisited</a></div><div class="ttdeci">void markVisited(Vertex *v)</div><div class="ttdef"><b>Definition:</b> DFSAPHeuristic.h:75</div></div>
<div class="ttc" id="classDFSAPHeuristic_html_a6be8de5d724975d145500fc7a1f12198"><div class="ttname"><a href="classDFSAPHeuristic.html#a6be8de5d724975d145500fc7a1f12198">DFSAPHeuristic::run</a></div><div class="ttdeci">void run(void)</div><div class="ttdef"><b>Definition:</b> DFSAPHeuristic.cc:73</div></div>
<div class="ttc" id="classDFSAPHeuristic_html_a64e8f25fe3d703673d4e32531eb53ff0"><div class="ttname"><a href="classDFSAPHeuristic.html#a64e8f25fe3d703673d4e32531eb53ff0">DFSAPHeuristic::isVisited</a></div><div class="ttdeci">bool isVisited(Vertex *v) const </div><div class="ttdef"><b>Definition:</b> DFSAPHeuristic.h:82</div></div>
<div class="ttc" id="classDFSAPHeuristic_html_a58332cda0fbc79a94ff15b2715cdb59e"><div class="ttname"><a href="classDFSAPHeuristic.html#a58332cda0fbc79a94ff15b2715cdb59e">DFSAPHeuristic::TimeCounter</a></div><div class="ttdeci">UWORD32 TimeCounter</div><div class="ttdef"><b>Definition:</b> DFSAPHeuristic.h:86</div></div>
<div class="ttc" id="classMatchingAlgorithm_html"><div class="ttname"><a href="classMatchingAlgorithm.html">MatchingAlgorithm</a></div><div class="ttdef"><b>Definition:</b> MatchingAlgorithm.h:27</div></div>
<div class="ttc" id="classDFSAPHeuristic_html_a8fbae63f1ab832aacf5c432e1270589e"><div class="ttname"><a href="classDFSAPHeuristic.html#a8fbae63f1ab832aacf5c432e1270589e">DFSAPHeuristic::getNextEdge</a></div><div class="ttdeci">const Edge * getNextEdge(Vertex *v)</div><div class="ttdef"><b>Definition:</b> DFSAPHeuristic.cc:221</div></div>
<div class="ttc" id="classVertex_html"><div class="ttname"><a href="classVertex.html">Vertex</a></div><div class="ttdoc">a vertex in a graph </div><div class="ttdef"><b>Definition:</b> Vertex.h:43</div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Fri Oct 18 2013 17:59:36 for steghide by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.5
</small></address>
</body>
</html>

Perl :: Catalyst :: PostgreSQL :: RPM Valid HTML 4.01 Transitional