BFSAPHeuristic.h
Go to the documentation of this file.
/*
* steghide 0.5.1 - a steganography program
* Copyright (C) 1999-2003 Stefan Hetzl <shetzl@chello.at>
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
*/
#ifndef SH_BFSAPHeuristic
#define SH_BFSAPHeuristic
#include "EdgeIterator.h"
#include "MatchingAlgorithm.h"
#include "Vertex.h"
class Edge ;
#include "Graph.h"
class Matching ;
class BFSAPHeuristic : public MatchingAlgorithm {
public:
BFSAPHeuristic (Graph* g, Matching* m) ;
virtual ~BFSAPHeuristic (void) ;
const char* getName (void) const
{ return "BFS Augmenting Path Heuristic" ; } ;
void run (void) ;
private:
unsigned long searchAugmentingPath (Vertex* v0, const Edge** path) ;
bool* VertexVisited ;
Edge* BackEdge ;
} ;
#endif // ndef SH_BFSAPHeuristic
BFSAPHeuristic::run
void run(void)
Definition: BFSAPHeuristic.cc:46
MatchingAlgorithm.h
BFSAPHeuristic::VertexVisited
bool * VertexVisited
Definition: BFSAPHeuristic.h:60
Graph
a graph constructed from a cover file and a message to be embedded
Definition: Graph.h:51
BFSAPHeuristic
a matching algorithm implementing a heuristic breadth-first-search for augmenting paths ...
Definition: BFSAPHeuristic.h:36
Edge
Definition: Edge.h:28
BFSAPHeuristic::searchAugmentingPath
unsigned long searchAugmentingPath(Vertex *v0, const Edge **path)
Definition: BFSAPHeuristic.cc:82
BFSAPHeuristic::BFSAPHeuristic
BFSAPHeuristic(Graph *g, Matching *m)
Definition: BFSAPHeuristic.cc:28
EdgeIterator.h
Matching
represent a matching on a graph
Definition: Matching.h:41
BFSAPHeuristic::~BFSAPHeuristic
virtual ~BFSAPHeuristic(void)
Definition: BFSAPHeuristic.cc:40
Vertex.h
BFSAPHeuristic::getName
const char * getName(void) const
Definition: BFSAPHeuristic.h:47
Graph.h
MatchingAlgorithm
Definition: MatchingAlgorithm.h:27
Vertex
a vertex in a graph
Definition: Vertex.h:43
BFSAPHeuristic::BackEdge
Edge * BackEdge
Definition: BFSAPHeuristic.h:61