<!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: WKSConstructionHeuristic.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
 <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 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 List</span></a></li>
<li><a href="globals.html"><span>File 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">WKSConstructionHeuristic.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="WKSConstructionHeuristic_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> <span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"> * steghide 0.5.1 - a steganography program</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * Copyright (C) 1999-2003 Stefan Hetzl <shetzl@chello.at></span></div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <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> <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> <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> <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> <span class="comment"> *</span></div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <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> <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> <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> <span class="comment"> * GNU General Public License for more details.</span></div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <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> <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> <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> <span class="comment"> *</span></div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#ifndef SH_WKSCONSTRUCTIONHEURISTIC_H</span></div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor"></span><span class="preprocessor">#define SH_WKSCONSTRUCTIONHEURISTIC_H</span></div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <functional></span></div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <queue></span></div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include <vector></span></div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> </div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <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> <span class="keyword">class </span><a class="code" href="classGraph.html">Graph</a> ;</div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <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> <span class="preprocessor">#include "<a class="code" href="MatchingAlgorithm_8h.html">MatchingAlgorithm.h</a>"</span></div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="keyword">class </span><a class="code" href="classProgressOutput.html">ProgressOutput</a> ;</div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keyword">class </span><a class="code" href="classVertex.html">Vertex</a> ;</div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include "<a class="code" href="common_8h.html">common.h</a>"</span></div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> </div>
<div class="line"><a name="l00048"></a><span class="lineno"><a class="line" href="classWKSConstructionHeuristic.html"> 48</a></span> <span class="keyword">class </span><a class="code" href="classWKSConstructionHeuristic.html">WKSConstructionHeuristic</a> : <span class="keyword">public</span> <a class="code" href="classMatchingAlgorithm.html">MatchingAlgorithm</a> {</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keyword">public</span>:</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <a class="code" href="classWKSConstructionHeuristic.html#afd24063c7439518b3d1381d11a8a760f">WKSConstructionHeuristic</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) ;</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> </div>
<div class="line"><a name="l00056"></a><span class="lineno"><a class="line" href="classWKSConstructionHeuristic.html#ada1e6ce80969aa9c0be22d62e60f5909"> 56</a></span>  <span class="keyword">virtual</span> <a class="code" href="classWKSConstructionHeuristic.html#ada1e6ce80969aa9c0be22d62e60f5909">~WKSConstructionHeuristic</a> (<span class="keywordtype">void</span>) {} ;</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div>
<div class="line"><a name="l00058"></a><span class="lineno"><a class="line" href="classWKSConstructionHeuristic.html#a16ff5405de18effbf58bba0b89670a52"> 58</a></span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* <a class="code" href="classWKSConstructionHeuristic.html#a16ff5405de18effbf58bba0b89670a52">getName</a> (<span class="keywordtype">void</span>)<span class="keyword"> const</span></div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> <span class="stringliteral">"Weighted Karp&Sipser Construction Heuristic"</span> ; } ;</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> </div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keywordtype">void</span> <a class="code" href="classWKSConstructionHeuristic.html#a04c931636b6e457493b6bc25697f98fb">run</a> (<span class="keywordtype">void</span>) ;</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div>
<div class="line"><a name="l00073"></a><span class="lineno"><a class="line" href="classWKSConstructionHeuristic_1_1LongerShortestEdge.html"> 73</a></span>  <span class="keyword">class </span><a class="code" href="classWKSConstructionHeuristic_1_1LongerShortestEdge.html">LongerShortestEdge</a> : <span class="keyword">public</span> std::binary_function<Vertex*,Vertex*,bool> {</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keyword">public</span>:</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordtype">bool</span> <a class="code" href="classWKSConstructionHeuristic_1_1LongerShortestEdge.html#ae3ea58e171cf43e75e217d4c15657244">operator() </a>(<span class="keyword">const</span> <a class="code" href="classVertex.html">Vertex</a> *v1, <span class="keyword">const</span> <a class="code" href="classVertex.html">Vertex</a> *v2) ;</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  } ;</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> </div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="preprocessor">#ifdef DEBUG</span></div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="preprocessor"></span> <span class="keywordtype">void</span> print (<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> spc = 0) ;</div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordtype">void</span> printPQ (std::priority_queue<<a class="code" href="classVertex.html">Vertex</a>*, std::vector<Vertex*>, <a class="code" href="classWKSConstructionHeuristic_1_1LongerShortestEdge.html">LongerShortestEdge</a>>& pq) ;</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keyword">private</span>:</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <a class="code" href="classVertex.html">Vertex</a> *<a class="code" href="classWKSConstructionHeuristic.html#ab466858ce4ff82430552c7ef6db8a2eb">findVertexDeg1</a> (<span class="keywordtype">void</span>) ;</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> </div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <a class="code" href="classVertex.html">Vertex</a> *<a class="code" href="classWKSConstructionHeuristic.html#a1c2233d1625f773b3fa32cb7278e9396">findVertexDegG</a> (<span class="keywordtype">void</span>) ;</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> </div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordtype">void</span> <a class="code" href="classWKSConstructionHeuristic.html#a87e4ebbe9b5c5622d4ba2d9eb740e184">checkNeighboursDeg1</a> (<a class="code" href="classVertex.html">Vertex</a> *v) ;</div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> </div>
<div class="line"><a name="l00100"></a><span class="lineno"><a class="line" href="classWKSConstructionHeuristic.html#aa10ccd5f02c16ed9207f10101dd50c43"> 100</a></span>  std::priority_queue<Vertex*, std::vector<Vertex*>, <a class="code" href="classWKSConstructionHeuristic_1_1LongerShortestEdge.html">LongerShortestEdge</a>> <a class="code" href="classWKSConstructionHeuristic.html#aa10ccd5f02c16ed9207f10101dd50c43">VerticesDeg1</a> ;</div>
<div class="line"><a name="l00102"></a><span class="lineno"><a class="line" href="classWKSConstructionHeuristic.html#acb53370d5b437466e6eaed1507dcf2f9"> 102</a></span>  std::priority_queue<Vertex*, std::vector<Vertex*>, <a class="code" href="classWKSConstructionHeuristic_1_1LongerShortestEdge.html">LongerShortestEdge</a>> <a class="code" href="classWKSConstructionHeuristic.html#acb53370d5b437466e6eaed1507dcf2f9">VerticesDegG</a> ;</div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> } ;</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> </div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="preprocessor">#endif // ndef SH_WKSCONSTRUCTIONHEURISTIC_H</span></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="classWKSConstructionHeuristic_html_ada1e6ce80969aa9c0be22d62e60f5909"><div class="ttname"><a href="classWKSConstructionHeuristic.html#ada1e6ce80969aa9c0be22d62e60f5909">WKSConstructionHeuristic::~WKSConstructionHeuristic</a></div><div class="ttdeci">virtual ~WKSConstructionHeuristic(void)</div><div class="ttdef"><b>Definition:</b> WKSConstructionHeuristic.h:56</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="classWKSConstructionHeuristic_1_1LongerShortestEdge_html"><div class="ttname"><a href="classWKSConstructionHeuristic_1_1LongerShortestEdge.html">WKSConstructionHeuristic::LongerShortestEdge</a></div><div class="ttdoc">a comparison operator </div><div class="ttdef"><b>Definition:</b> WKSConstructionHeuristic.h:73</div></div>
<div class="ttc" id="classWKSConstructionHeuristic_html_a16ff5405de18effbf58bba0b89670a52"><div class="ttname"><a href="classWKSConstructionHeuristic.html#a16ff5405de18effbf58bba0b89670a52">WKSConstructionHeuristic::getName</a></div><div class="ttdeci">const char * getName(void) const </div><div class="ttdef"><b>Definition:</b> WKSConstructionHeuristic.h:58</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="classWKSConstructionHeuristic_html_a87e4ebbe9b5c5622d4ba2d9eb740e184"><div class="ttname"><a href="classWKSConstructionHeuristic.html#a87e4ebbe9b5c5622d4ba2d9eb740e184">WKSConstructionHeuristic::checkNeighboursDeg1</a></div><div class="ttdeci">void checkNeighboursDeg1(Vertex *v)</div><div class="ttdef"><b>Definition:</b> WKSConstructionHeuristic.cc:98</div></div>
<div class="ttc" id="classProgressOutput_html"><div class="ttname"><a href="classProgressOutput.html">ProgressOutput</a></div><div class="ttdoc">prints the progress to stdout </div><div class="ttdef"><b>Definition:</b> ProgressOutput.h:32</div></div>
<div class="ttc" id="classWKSConstructionHeuristic_html_afd24063c7439518b3d1381d11a8a760f"><div class="ttname"><a href="classWKSConstructionHeuristic.html#afd24063c7439518b3d1381d11a8a760f">WKSConstructionHeuristic::WKSConstructionHeuristic</a></div><div class="ttdeci">WKSConstructionHeuristic(Graph *g, Matching *m, float goal=100.0)</div><div class="ttdef"><b>Definition:</b> WKSConstructionHeuristic.cc:27</div></div>
<div class="ttc" id="classWKSConstructionHeuristic_html_a04c931636b6e457493b6bc25697f98fb"><div class="ttname"><a href="classWKSConstructionHeuristic.html#a04c931636b6e457493b6bc25697f98fb">WKSConstructionHeuristic::run</a></div><div class="ttdeci">void run(void)</div><div class="ttdef"><b>Definition:</b> WKSConstructionHeuristic.cc:52</div></div>
<div class="ttc" id="classWKSConstructionHeuristic_html_acb53370d5b437466e6eaed1507dcf2f9"><div class="ttname"><a href="classWKSConstructionHeuristic.html#acb53370d5b437466e6eaed1507dcf2f9">WKSConstructionHeuristic::VerticesDegG</a></div><div class="ttdeci">std::priority_queue< Vertex *, std::vector< Vertex * >, LongerShortestEdge > VerticesDegG</div><div class="ttdoc">contains all vertices with degree greater than 1 </div><div class="ttdef"><b>Definition:</b> WKSConstructionHeuristic.h:102</div></div>
<div class="ttc" id="classWKSConstructionHeuristic_html_aa10ccd5f02c16ed9207f10101dd50c43"><div class="ttname"><a href="classWKSConstructionHeuristic.html#aa10ccd5f02c16ed9207f10101dd50c43">WKSConstructionHeuristic::VerticesDeg1</a></div><div class="ttdeci">std::priority_queue< Vertex *, std::vector< Vertex * >, LongerShortestEdge > VerticesDeg1</div><div class="ttdoc">contains all vertices of degree 1 - every vertex in this queue has a correct shortest edge if it stil...</div><div class="ttdef"><b>Definition:</b> WKSConstructionHeuristic.h:100</div></div>
<div class="ttc" id="classWKSConstructionHeuristic_html"><div class="ttname"><a href="classWKSConstructionHeuristic.html">WKSConstructionHeuristic</a></div><div class="ttdoc">a heuristic algorithm for constructing a matching </div><div class="ttdef"><b>Definition:</b> WKSConstructionHeuristic.h:48</div></div>
<div class="ttc" id="classWKSConstructionHeuristic_html_ab466858ce4ff82430552c7ef6db8a2eb"><div class="ttname"><a href="classWKSConstructionHeuristic.html#ab466858ce4ff82430552c7ef6db8a2eb">WKSConstructionHeuristic::findVertexDeg1</a></div><div class="ttdeci">Vertex * findVertexDeg1(void)</div><div class="ttdef"><b>Definition:</b> WKSConstructionHeuristic.cc:153</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="classWKSConstructionHeuristic_html_a1c2233d1625f773b3fa32cb7278e9396"><div class="ttname"><a href="classWKSConstructionHeuristic.html#a1c2233d1625f773b3fa32cb7278e9396">WKSConstructionHeuristic::findVertexDegG</a></div><div class="ttdeci">Vertex * findVertexDegG(void)</div><div class="ttdef"><b>Definition:</b> WKSConstructionHeuristic.cc:124</div></div>
<div class="ttc" id="common_8h_html"><div class="ttname"><a href="common_8h.html">common.h</a></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="classWKSConstructionHeuristic_1_1LongerShortestEdge_html_ae3ea58e171cf43e75e217d4c15657244"><div class="ttname"><a href="classWKSConstructionHeuristic_1_1LongerShortestEdge.html#ae3ea58e171cf43e75e217d4c15657244">WKSConstructionHeuristic::LongerShortestEdge::operator()</a></div><div class="ttdeci">bool operator()(const Vertex *v1, const Vertex *v2)</div><div class="ttdef"><b>Definition:</b> WKSConstructionHeuristic.cc:172</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  <a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.5
</small></address>
</body>
</html>
distrib
>
Mageia
>
4
>
i586
>
media
>
core-release
>
by-pkgid
>
2a90dcd9dfcd284ddf6dc3b0a0b0bf47
>
files
>
250
