steghide  0.5.1
DMDConstructionHeuristic.h
Go to the documentation of this file.
1 /*
2  * steghide 0.5.1 - a steganography program
3  * Copyright (C) 1999-2003 Stefan Hetzl <shetzl@chello.at>
4  *
5  * This program is free software; you can redistribute it and/or
6  * modify it under the terms of the GNU General Public License
7  * as published by the Free Software Foundation; either version 2
8  * of the License, or (at your option) any later version.
9  *
10  * This program is distributed in the hope that it will be useful,
11  * but WITHOUT ANY WARRANTY; without even the implied warranty of
12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13  * GNU General Public License for more details.
14  *
15  * You should have received a copy of the GNU General Public License
16  * along with this program; if not, write to the Free Software
17  * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
18  *
19  */
20 
21 #ifndef SH_DMDCONSTRUCTIONHEURISTIC_H
22 #define SH_DMDCONSTRUCTIONHEURISTIC_H
23 
24 #include "MatchingAlgorithm.h"
25 class Vertex ;
26 #include "common.h"
27 
33  public:
34  DMDConstructionHeuristic (Graph* g, Matching* m, float goal = 100.0) ;
35 
36  virtual ~DMDConstructionHeuristic (void) {} ;
37 
38  const char* getName (void) const
39  { return "Dynamic Minimum Degree Construction Heuristic" ; } ;
40 
41  void run (void) ;
42 
43  private:
45 
46  std::vector<Vertex*> AvailableVertices ;
47 
48  VertexLabel findMinDegIndex (const std::vector<Vertex*>& vertices) ;
49 } ;
50 
51 #endif // ndef SH_DMDCONSTRUCTIONHEURISTIC_H
static const VertexLabel MinDegNotFound
Definition: DMDConstructionHeuristic.h:44
std::vector< Vertex * > AvailableVertices
Definition: DMDConstructionHeuristic.h:46
a graph constructed from a cover file and a message to be embedded
Definition: Graph.h:51
VertexLabel findMinDegIndex(const std::vector< Vertex *> &vertices)
Definition: DMDConstructionHeuristic.cc:56
DMDConstructionHeuristic(Graph *g, Matching *m, float goal=100.0)
Definition: DMDConstructionHeuristic.cc:27
void run(void)
Definition: DMDConstructionHeuristic.cc:36
an implementation of the "dynamic minimum degree" heuristic for contruction a matching ...
Definition: DMDConstructionHeuristic.h:32
virtual ~DMDConstructionHeuristic(void)
Definition: DMDConstructionHeuristic.h:36
UWORD32 VertexLabel
Definition: common.h:68
represent a matching on a graph
Definition: Matching.h:41
#define VERTEXLABEL_MAX
Definition: common.h:73
const char * getName(void) const
Definition: DMDConstructionHeuristic.h:38
Definition: MatchingAlgorithm.h:27
a vertex in a graph
Definition: Vertex.h:43