Sophie

Sophie

distrib > Mandriva > 2010.0 > i586 > media > contrib-release > by-pkgid > 7392c77c84ff25edfeb07995a77d5148 > files > 99

steghide-0.5.1-11mdv2010.0.i586.rpm

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>steghide: DFSAPHeuristic.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css">
<link href="doxygen.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.9 -->
<div class="navigation" id="top">
  <div class="tabs">
    <ul>
      <li><a href="index.html"><span>Main&nbsp;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 class="tabs">
    <ul>
      <li><a href="files.html"><span>File&nbsp;List</span></a></li>
      <li><a href="globals.html"><span>File&nbsp;Members</span></a></li>
    </ul>
  </div>
<h1>DFSAPHeuristic.h</h1><a href="DFSAPHeuristic_8h.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> * steghide 0.5.1 - a steganography program</span>
<a name="l00003"></a>00003 <span class="comment"> * Copyright (C) 1999-2003 Stefan Hetzl &lt;shetzl@chello.at&gt;</span>
<a name="l00004"></a>00004 <span class="comment"> *</span>
<a name="l00005"></a>00005 <span class="comment"> * This program is free software; you can redistribute it and/or</span>
<a name="l00006"></a>00006 <span class="comment"> * modify it under the terms of the GNU General Public License</span>
<a name="l00007"></a>00007 <span class="comment"> * as published by the Free Software Foundation; either version 2</span>
<a name="l00008"></a>00008 <span class="comment"> * of the License, or (at your option) any later version.</span>
<a name="l00009"></a>00009 <span class="comment"> *</span>
<a name="l00010"></a>00010 <span class="comment"> * This program is distributed in the hope that it will be useful,</span>
<a name="l00011"></a>00011 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00012"></a>00012 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span>
<a name="l00013"></a>00013 <span class="comment"> * GNU General Public License for more details.</span>
<a name="l00014"></a>00014 <span class="comment"> *</span>
<a name="l00015"></a>00015 <span class="comment"> * You should have received a copy of the GNU General Public License</span>
<a name="l00016"></a>00016 <span class="comment"> * along with this program; if not, write to the Free Software</span>
<a name="l00017"></a>00017 <span class="comment"> * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.</span>
<a name="l00018"></a>00018 <span class="comment"> *</span>
<a name="l00019"></a>00019 <span class="comment"> */</span>
<a name="l00020"></a>00020 
<a name="l00021"></a>00021 <span class="preprocessor">#ifndef SH_DFSAPHEURISTIC</span>
<a name="l00022"></a>00022 <span class="preprocessor"></span><span class="preprocessor">#define SH_DFSAPHEURISTIC</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span>
<a name="l00024"></a>00024 <span class="preprocessor">#include "<a class="code" href="EdgeIterator_8h.html">EdgeIterator.h</a>"</span>
<a name="l00025"></a>00025 <span class="preprocessor">#include "<a class="code" href="MatchingAlgorithm_8h.html">MatchingAlgorithm.h</a>"</span>
<a name="l00026"></a>00026 <span class="preprocessor">#include "<a class="code" href="Vertex_8h.html">Vertex.h</a>"</span>
<a name="l00027"></a>00027 
<a name="l00028"></a>00028 <span class="keyword">class </span><a class="code" href="classEdge.html">Edge</a> ;
<a name="l00029"></a>00029 <span class="preprocessor">#include "<a class="code" href="Graph_8h.html">Graph.h</a>"</span>
<a name="l00030"></a>00030 <span class="keyword">class </span><a class="code" href="classMatching.html" title="represent a matching on a graph">Matching</a> ;
<a name="l00031"></a>00031 
<a name="l00040"></a><a class="code" href="classDFSAPHeuristic.html">00040</a> <span class="keyword">class </span><a class="code" href="classDFSAPHeuristic.html" title="a matching algorithm implementing a heuristic search for augmenting paths">DFSAPHeuristic</a> : <span class="keyword">public</span> <a class="code" href="classMatchingAlgorithm.html">MatchingAlgorithm</a> {
<a name="l00041"></a>00041         <span class="keyword">public</span>:
<a name="l00050"></a>00050         <a class="code" href="classDFSAPHeuristic.html#b0d70281dd13170430076bb6bf7e6d9d">DFSAPHeuristic</a> (<a class="code" href="classGraph.html" title="a graph constructed from a cover file and a message to be embedded">Graph</a>* g, <a class="code" href="classMatching.html" title="represent a matching on a graph">Matching</a>* m, <span class="keywordtype">float</span> goal = 100.0, <a class="code" href="common_8h.html#6b8592979b076e06aa233e3f586ac999">UWORD32</a> mne = <a class="code" href="common_8h.html#7c5e1100effed542218f9eff1db76b6a">UWORD32_MAX</a>, <a class="code" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f">EdgeIterator::ITERATIONMODE</a> mo = <a class="code" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f6406f55724d4783ed9a29dc26ffbafc6">EdgeIterator::SAMPLEOCCURENCE</a>) ;
<a name="l00051"></a>00051 
<a name="l00052"></a>00052         <span class="keyword">virtual</span> <a class="code" href="classDFSAPHeuristic.html#995ea2e59f6b27143da1efa3799c68f4">~DFSAPHeuristic</a> (<span class="keywordtype">void</span>) ;
<a name="l00053"></a>00053 
<a name="l00054"></a><a class="code" href="classDFSAPHeuristic.html#8ee345a8b89cbc8cf4f4ef7d8305ff6d">00054</a>         <span class="keyword">const</span> <span class="keywordtype">char</span>* <a class="code" href="classDFSAPHeuristic.html#8ee345a8b89cbc8cf4f4ef7d8305ff6d">getName</a> (<span class="keywordtype">void</span>)<span class="keyword"> const</span>
<a name="l00055"></a>00055 <span class="keyword">                </span>{ <span class="keywordflow">return</span> <span class="stringliteral">"DFS Augmenting Path Heuristic"</span> ; } ;
<a name="l00056"></a>00056 
<a name="l00061"></a>00061         <span class="keywordtype">void</span> <a class="code" href="classDFSAPHeuristic.html#a32cf73dfea46c56170ab93d038aa1bb">reset</a> (<a class="code" href="common_8h.html#6b8592979b076e06aa233e3f586ac999">UWORD32</a> mne = <a class="code" href="common_8h.html#7c5e1100effed542218f9eff1db76b6a">UWORD32_MAX</a>, <a class="code" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f">EdgeIterator::ITERATIONMODE</a> mo = <a class="code" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f6406f55724d4783ed9a29dc26ffbafc6">EdgeIterator::SAMPLEOCCURENCE</a>) ;
<a name="l00062"></a>00062 
<a name="l00063"></a>00063         <span class="keywordtype">void</span> <a class="code" href="classDFSAPHeuristic.html#6be8de5d724975d145500fc7a1f12198">run</a> (<span class="keywordtype">void</span>) ;
<a name="l00064"></a>00064 
<a name="l00065"></a>00065         <span class="keyword">private</span>:
<a name="l00071"></a>00071         <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <a class="code" href="classDFSAPHeuristic.html#2046bacf3bdd3468cd5732bb7544a090">searchAugmentingPath</a> (<a class="code" href="classVertex.html" title="a vertex in a graph">Vertex</a>* v0, <span class="keyword">const</span> <a class="code" href="classEdge.html">Edge</a>** path) ;
<a name="l00072"></a>00072 
<a name="l00073"></a>00073         <span class="keyword">const</span> <a class="code" href="classEdge.html">Edge</a>* <a class="code" href="classDFSAPHeuristic.html#8fbae63f1ab832aacf5c432e1270589e">getNextEdge</a> (<a class="code" href="classVertex.html" title="a vertex in a graph">Vertex</a> *v) ;
<a name="l00074"></a>00074 
<a name="l00075"></a><a class="code" href="classDFSAPHeuristic.html#88358a5e013978a2211d6cc94cbc19e8">00075</a>         <span class="keywordtype">void</span> <a class="code" href="classDFSAPHeuristic.html#88358a5e013978a2211d6cc94cbc19e8">markVisited</a> (<a class="code" href="classVertex.html" title="a vertex in a graph">Vertex</a> *v)
<a name="l00076"></a>00076                 { <a class="code" href="classDFSAPHeuristic.html#ef8179c11e9f17f0499281ff4ea04a57">TimeCounters</a>[v-&gt;<a class="code" href="classVertex.html#d1473af6f3e4d28c15d1f28a560717ea">getLabel</a>()] = <a class="code" href="classDFSAPHeuristic.html#58332cda0fbc79a94ff15b2715cdb59e">TimeCounter</a> ; } ;
<a name="l00077"></a>00077 
<a name="l00082"></a><a class="code" href="classDFSAPHeuristic.html#64e8f25fe3d703673d4e32531eb53ff0">00082</a>         <span class="keywordtype">bool</span> <a class="code" href="classDFSAPHeuristic.html#64e8f25fe3d703673d4e32531eb53ff0">isVisited</a> (<a class="code" href="classVertex.html" title="a vertex in a graph">Vertex</a> *v)<span class="keyword"> const</span>
<a name="l00083"></a>00083 <span class="keyword">                </span>{ <span class="keywordflow">return</span> <a class="code" href="classDFSAPHeuristic.html#64e8f25fe3d703673d4e32531eb53ff0">isVisited</a>(v-&gt;<a class="code" href="classVertex.html#d1473af6f3e4d28c15d1f28a560717ea">getLabel</a>()) ; } ;
<a name="l00084"></a>00084 
<a name="l00085"></a><a class="code" href="classDFSAPHeuristic.html#43559467d5f822ecaf739b215bb64441">00085</a>         <span class="keywordtype">bool</span> <a class="code" href="classDFSAPHeuristic.html#64e8f25fe3d703673d4e32531eb53ff0">isVisited</a> (<a class="code" href="common_8h.html#b9c88dfaf90b738f73f1700aa77d06ef">VertexLabel</a> vlbl)<span class="keyword"> const</span>
<a name="l00086"></a><a class="code" href="classDFSAPHeuristic.html#58332cda0fbc79a94ff15b2715cdb59e">00086</a> <span class="keyword">                </span>{ <span class="keywordflow">return</span> (<a class="code" href="classDFSAPHeuristic.html#ef8179c11e9f17f0499281ff4ea04a57">TimeCounters</a>[vlbl] == <a class="code" href="classDFSAPHeuristic.html#58332cda0fbc79a94ff15b2715cdb59e">TimeCounter</a>) ; } ;
<a name="l00087"></a>00087 
<a name="l00088"></a>00088         <a class="code" href="common_8h.html#6b8592979b076e06aa233e3f586ac999">UWORD32</a> <a class="code" href="classDFSAPHeuristic.html#58332cda0fbc79a94ff15b2715cdb59e">TimeCounter</a> ;
<a name="l00089"></a><a class="code" href="classDFSAPHeuristic.html#ef8179c11e9f17f0499281ff4ea04a57">00089</a>         <a class="code" href="common_8h.html#6b8592979b076e06aa233e3f586ac999">UWORD32</a>* <a class="code" href="classDFSAPHeuristic.html#ef8179c11e9f17f0499281ff4ea04a57">TimeCounters</a> ;
<a name="l00090"></a><a class="code" href="classDFSAPHeuristic.html#25fe18d2559609eab338ab4c2fffd9fc">00090</a>         <span class="keywordtype">bool</span>* <a class="code" href="classDFSAPHeuristic.html#25fe18d2559609eab338ab4c2fffd9fc">VertexOnPath</a> ;
<a name="l00091"></a><a class="code" href="classDFSAPHeuristic.html#a31f7a99d7771193e274d962c2841a2c">00091</a>         <a class="code" href="classEdgeIterator.html" title="allows an iteration trough all edges of a vertex">EdgeIterator</a>* <a class="code" href="classDFSAPHeuristic.html#a31f7a99d7771193e274d962c2841a2c">EdgeIterators</a> ;
<a name="l00092"></a>00092 
<a name="l00093"></a>00093 <span class="preprocessor">#ifdef DEBUG</span>
<a name="l00095"></a>00095 <span class="preprocessor">        unsigned long long NEdgesSuccessful ;</span>
<a name="l00097"></a>00097 <span class="preprocessor">        unsigned long long NEdgesUnsuccessful ;</span>
<a name="l00099"></a>00099 <span class="preprocessor">        unsigned long NSuccessful ;</span>
<a name="l00101"></a>00101 <span class="preprocessor">        unsigned long NUnsuccessful ;</span>
<a name="l00103"></a>00103 <span class="preprocessor">        std::string SuccessString ;</span>
<a name="l00104"></a>00104 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00105"></a>00105 <span class="preprocessor"></span>} ;
<a name="l00106"></a>00106 
<a name="l00107"></a>00107 <span class="preprocessor">#endif // ndef SH_DFSAPHEURISTIC</span>
</pre></div></div>
<hr size="1"><address style="text-align: right;"><small>Generated on Mon Aug 17 10:58:29 2009 for steghide by&nbsp;
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.9 </small></address>
</body>
</html>

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