steghide  0.5.1
BFSAPHeuristic.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_BFSAPHeuristic
22 #define SH_BFSAPHeuristic
23 
24 #include "EdgeIterator.h"
25 #include "MatchingAlgorithm.h"
26 #include "Vertex.h"
27 
28 class Edge ;
29 #include "Graph.h"
30 class Matching ;
31 
37  public:
43  BFSAPHeuristic (Graph* g, Matching* m) ;
44 
45  virtual ~BFSAPHeuristic (void) ;
46 
47  const char* getName (void) const
48  { return "BFS Augmenting Path Heuristic" ; } ;
49 
50  void run (void) ;
51 
52  private:
58  unsigned long searchAugmentingPath (Vertex* v0, const Edge** path) ;
59 
60  bool* VertexVisited ;
62 } ;
63 
64 #endif // ndef SH_BFSAPHeuristic
void run(void)
Definition: BFSAPHeuristic.cc:46
bool * VertexVisited
Definition: BFSAPHeuristic.h:60
a graph constructed from a cover file and a message to be embedded
Definition: Graph.h:51
a matching algorithm implementing a heuristic breadth-first-search for augmenting paths ...
Definition: BFSAPHeuristic.h:36
Definition: Edge.h:28
unsigned long searchAugmentingPath(Vertex *v0, const Edge **path)
Definition: BFSAPHeuristic.cc:82
BFSAPHeuristic(Graph *g, Matching *m)
Definition: BFSAPHeuristic.cc:28
represent a matching on a graph
Definition: Matching.h:41
virtual ~BFSAPHeuristic(void)
Definition: BFSAPHeuristic.cc:40
const char * getName(void) const
Definition: BFSAPHeuristic.h:47
Definition: MatchingAlgorithm.h:27
a vertex in a graph
Definition: Vertex.h:43
Edge * BackEdge
Definition: BFSAPHeuristic.h:61