<!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: DMDConstructionHeuristic.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 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 List</span></a></li>
<li><a href="globals.html"><span>File Members</span></a></li>
</ul>
</div>
<h1>DMDConstructionHeuristic.h</h1><a href="DMDConstructionHeuristic_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 <shetzl@chello.at></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_DMDCONSTRUCTIONHEURISTIC_H</span>
<a name="l00022"></a>00022 <span class="preprocessor"></span><span class="preprocessor">#define SH_DMDCONSTRUCTIONHEURISTIC_H</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span>
<a name="l00024"></a>00024 <span class="preprocessor">#include "<a class="code" href="MatchingAlgorithm_8h.html">MatchingAlgorithm.h</a>"</span>
<a name="l00025"></a>00025 <span class="keyword">class </span><a class="code" href="classVertex.html" title="a vertex in a graph">Vertex</a> ;
<a name="l00026"></a>00026 <span class="preprocessor">#include "<a class="code" href="common_8h.html">common.h</a>"</span>
<a name="l00027"></a>00027
<a name="l00032"></a><a class="code" href="classDMDConstructionHeuristic.html">00032</a> <span class="keyword">class </span><a class="code" href="classDMDConstructionHeuristic.html" title="an implementation of the &quot;dynamic minimum degree&quot; heuristic for contruction...">DMDConstructionHeuristic</a> : <span class="keyword">public</span> <a class="code" href="classMatchingAlgorithm.html">MatchingAlgorithm</a> {
<a name="l00033"></a>00033 <span class="keyword">public</span>:
<a name="l00034"></a>00034 <a class="code" href="classDMDConstructionHeuristic.html#578457ff7ff24b7d3e39d4a2bd08e911">DMDConstructionHeuristic</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="l00035"></a>00035
<a name="l00036"></a><a class="code" href="classDMDConstructionHeuristic.html#d911ae35815f058a0b8b61733d13a765">00036</a> <span class="keyword">virtual</span> <a class="code" href="classDMDConstructionHeuristic.html#d911ae35815f058a0b8b61733d13a765">~DMDConstructionHeuristic</a> (<span class="keywordtype">void</span>) {} ;
<a name="l00037"></a>00037
<a name="l00038"></a><a class="code" href="classDMDConstructionHeuristic.html#be149c22a2f7e5f1be04ea6454229642">00038</a> <span class="keyword">const</span> <span class="keywordtype">char</span>* <a class="code" href="classDMDConstructionHeuristic.html#be149c22a2f7e5f1be04ea6454229642">getName</a> (<span class="keywordtype">void</span>)<span class="keyword"> const</span>
<a name="l00039"></a>00039 <span class="keyword"> </span>{ <span class="keywordflow">return</span> <span class="stringliteral">"Dynamic Minimum Degree Construction Heuristic"</span> ; } ;
<a name="l00040"></a>00040
<a name="l00041"></a>00041 <span class="keywordtype">void</span> <a class="code" href="classDMDConstructionHeuristic.html#49dd3ba3c89b0993922918379d3d3240">run</a> (<span class="keywordtype">void</span>) ;
<a name="l00042"></a>00042
<a name="l00043"></a>00043 <span class="keyword">private</span>:
<a name="l00044"></a><a class="code" href="classDMDConstructionHeuristic.html#334ec36b8c295dfb0aeacc511d78202f">00044</a> <span class="keyword">static</span> <span class="keyword">const</span> <a class="code" href="common_8h.html#b9c88dfaf90b738f73f1700aa77d06ef">VertexLabel</a> <a class="code" href="classDMDConstructionHeuristic.html#334ec36b8c295dfb0aeacc511d78202f">MinDegNotFound</a> = <a class="code" href="common_8h.html#124dd0e836ec26e66d24918bed871d62">VERTEXLABEL_MAX</a> ;
<a name="l00045"></a>00045
<a name="l00046"></a><a class="code" href="classDMDConstructionHeuristic.html#b0bee2f81d495adf006e8859c8da6daa">00046</a> std::vector<Vertex*> <a class="code" href="classDMDConstructionHeuristic.html#b0bee2f81d495adf006e8859c8da6daa">AvailableVertices</a> ;
<a name="l00047"></a>00047
<a name="l00048"></a>00048 <a class="code" href="common_8h.html#b9c88dfaf90b738f73f1700aa77d06ef">VertexLabel</a> <a class="code" href="classDMDConstructionHeuristic.html#1ffbeeee03312593c412e5e34b25134e">findMinDegIndex</a> (<span class="keyword">const</span> std::vector<Vertex*>& vertices) ;
<a name="l00049"></a>00049 } ;
<a name="l00050"></a>00050
<a name="l00051"></a>00051 <span class="preprocessor">#endif // ndef SH_DMDCONSTRUCTIONHEURISTIC_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
<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>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
7392c77c84ff25edfeb07995a77d5148
>
files
>
102
