Sophie

Sophie

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

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: WKSConstructionHeuristic.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>WKSConstructionHeuristic.h</h1><a href="WKSConstructionHeuristic_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_WKSCONSTRUCTIONHEURISTIC_H</span>
<a name="l00022"></a>00022 <span class="preprocessor"></span><span class="preprocessor">#define SH_WKSCONSTRUCTIONHEURISTIC_H</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span>
<a name="l00024"></a>00024 <span class="preprocessor">#include &lt;functional&gt;</span>
<a name="l00025"></a>00025 <span class="preprocessor">#include &lt;queue&gt;</span>
<a name="l00026"></a>00026 <span class="preprocessor">#include &lt;vector&gt;</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="keyword">class </span><a class="code" href="classGraph.html" title="a graph constructed from a cover file and a message to be embedded">Graph</a> ;
<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 <span class="preprocessor">#include "<a class="code" href="MatchingAlgorithm_8h.html">MatchingAlgorithm.h</a>"</span>
<a name="l00032"></a>00032 <span class="keyword">class </span><a class="code" href="classProgressOutput.html" title="prints the progress to stdout">ProgressOutput</a> ;
<a name="l00033"></a>00033 <span class="keyword">class </span><a class="code" href="classVertex.html" title="a vertex in a graph">Vertex</a> ;
<a name="l00034"></a>00034 <span class="preprocessor">#include "<a class="code" href="common_8h.html">common.h</a>"</span>
<a name="l00035"></a>00035 
<a name="l00048"></a><a class="code" href="classWKSConstructionHeuristic.html">00048</a> <span class="keyword">class </span><a class="code" href="classWKSConstructionHeuristic.html" title="a heuristic algorithm for constructing a matching">WKSConstructionHeuristic</a> : <span class="keyword">public</span> <a class="code" href="classMatchingAlgorithm.html">MatchingAlgorithm</a> {
<a name="l00049"></a>00049         <span class="keyword">public</span>:
<a name="l00054"></a>00054         <a class="code" href="classWKSConstructionHeuristic.html#fd24063c7439518b3d1381d11a8a760f">WKSConstructionHeuristic</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 name="l00055"></a>00055 
<a name="l00056"></a><a class="code" href="classWKSConstructionHeuristic.html#da1e6ce80969aa9c0be22d62e60f5909">00056</a>         <span class="keyword">virtual</span> <a class="code" href="classWKSConstructionHeuristic.html#da1e6ce80969aa9c0be22d62e60f5909">~WKSConstructionHeuristic</a> (<span class="keywordtype">void</span>) {} ;
<a name="l00057"></a>00057 
<a name="l00058"></a><a class="code" href="classWKSConstructionHeuristic.html#16ff5405de18effbf58bba0b89670a52">00058</a>         <span class="keyword">const</span> <span class="keywordtype">char</span>* <a class="code" href="classWKSConstructionHeuristic.html#16ff5405de18effbf58bba0b89670a52">getName</a> (<span class="keywordtype">void</span>)<span class="keyword"> const</span>
<a name="l00059"></a>00059 <span class="keyword">                </span>{ <span class="keywordflow">return</span> <span class="stringliteral">"Weighted Karp&amp;Sipser Construction Heuristic"</span> ; } ;
<a name="l00060"></a>00060 
<a name="l00061"></a>00061         <span class="keywordtype">void</span> <a class="code" href="classWKSConstructionHeuristic.html#04c931636b6e457493b6bc25697f98fb">run</a> (<span class="keywordtype">void</span>) ;
<a name="l00062"></a>00062 
<a name="l00073"></a><a class="code" href="classWKSConstructionHeuristic_1_1LongerShortestEdge.html">00073</a>         <span class="keyword">class </span><a class="code" href="classWKSConstructionHeuristic_1_1LongerShortestEdge.html" title="a comparison operator">LongerShortestEdge</a> : <span class="keyword">public</span> std::binary_function&lt;Vertex*,Vertex*,bool&gt; {
<a name="l00074"></a>00074                 <span class="keyword">public</span>:
<a name="l00075"></a>00075                 <span class="keywordtype">bool</span> <a class="code" href="classWKSConstructionHeuristic_1_1LongerShortestEdge.html#e3ea58e171cf43e75e217d4c15657244">operator() </a>(<span class="keyword">const</span> <a class="code" href="classVertex.html" title="a vertex in a graph">Vertex</a> *v1, <span class="keyword">const</span> <a class="code" href="classVertex.html" title="a vertex in a graph">Vertex</a> *v2) ;
<a name="l00076"></a>00076         } ;
<a name="l00077"></a>00077 
<a name="l00078"></a>00078 <span class="preprocessor">#ifdef DEBUG</span>
<a name="l00079"></a>00079 <span class="preprocessor"></span>        <span class="keywordtype">void</span> print (<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> spc = 0) ;
<a name="l00080"></a>00080         <span class="keywordtype">void</span> printPQ (std::priority_queue&lt;<a class="code" href="classVertex.html" title="a vertex in a graph">Vertex</a>*, std::vector&lt;Vertex*&gt;, <a class="code" href="classWKSConstructionHeuristic_1_1LongerShortestEdge.html" title="a comparison operator">LongerShortestEdge</a>&gt;&amp; pq) ;
<a name="l00081"></a>00081 <span class="preprocessor">#endif</span>
<a name="l00082"></a>00082 <span class="preprocessor"></span>
<a name="l00083"></a>00083         <span class="keyword">private</span>:
<a name="l00087"></a>00087         <a class="code" href="classVertex.html" title="a vertex in a graph">Vertex</a> *<a class="code" href="classWKSConstructionHeuristic.html#b466858ce4ff82430552c7ef6db8a2eb">findVertexDeg1</a> (<span class="keywordtype">void</span>) ;
<a name="l00088"></a>00088 
<a name="l00092"></a>00092         <a class="code" href="classVertex.html" title="a vertex in a graph">Vertex</a> *<a class="code" href="classWKSConstructionHeuristic.html#1c2233d1625f773b3fa32cb7278e9396">findVertexDegG</a> (<span class="keywordtype">void</span>) ;
<a name="l00093"></a>00093 
<a name="l00097"></a>00097         <span class="keywordtype">void</span> <a class="code" href="classWKSConstructionHeuristic.html#87e4ebbe9b5c5622d4ba2d9eb740e184">checkNeighboursDeg1</a> (<a class="code" href="classVertex.html" title="a vertex in a graph">Vertex</a> *v) ;
<a name="l00098"></a>00098 
<a name="l00100"></a><a class="code" href="classWKSConstructionHeuristic.html#a10ccd5f02c16ed9207f10101dd50c43">00100</a>         std::priority_queue&lt;Vertex*, std::vector&lt;Vertex*&gt;, <a class="code" href="classWKSConstructionHeuristic_1_1LongerShortestEdge.html" title="a comparison operator">LongerShortestEdge</a>&gt; <a class="code" href="classWKSConstructionHeuristic.html#a10ccd5f02c16ed9207f10101dd50c43" title="contains all vertices of degree 1 - every vertex in this queue has a correct shortest...">VerticesDeg1</a> ;
<a name="l00102"></a><a class="code" href="classWKSConstructionHeuristic.html#cb53370d5b437466e6eaed1507dcf2f9">00102</a>         std::priority_queue&lt;Vertex*, std::vector&lt;Vertex*&gt;, <a class="code" href="classWKSConstructionHeuristic_1_1LongerShortestEdge.html" title="a comparison operator">LongerShortestEdge</a>&gt; <a class="code" href="classWKSConstructionHeuristic.html#cb53370d5b437466e6eaed1507dcf2f9" title="contains all vertices with degree greater than 1">VerticesDegG</a> ;
<a name="l00103"></a>00103 } ;
<a name="l00104"></a>00104 
<a name="l00105"></a>00105 <span class="preprocessor">#endif // ndef SH_WKSCONSTRUCTIONHEURISTIC_H</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