21#ifndef SH_SMDCONSTRUCTIONHEURISTIC_H
22#define SH_SMDCONSTRUCTIONHEURISTIC_H
39 {
return "Static Minimum Degree Construction Heuristic" ; } ;
a graph constructed from a cover file and a message to be embedded
Definition: Graph.h:51
Definition: MatchingAlgorithm.h:27
represent a matching on a graph
Definition: Matching.h:41
Definition: SMDConstructionHeuristic.h:44
bool operator()(const Vertex *v1, const Vertex *v2)
Definition: SMDConstructionHeuristic.h:46
an implementation of the "static minimum degree" heuristic for contructing a matching
Definition: SMDConstructionHeuristic.h:32
SMDConstructionHeuristic(Graph *g, Matching *m, float goal=100.0)
Definition: SMDConstructionHeuristic.cc:27
void run(void)
Definition: SMDConstructionHeuristic.cc:39
virtual ~SMDConstructionHeuristic(void)
Definition: SMDConstructionHeuristic.h:36
const char * getName(void) const
Definition: SMDConstructionHeuristic.h:38
std::vector< Vertex * > Vertices
Definition: SMDConstructionHeuristic.h:50
a vertex in a graph
Definition: Vertex.h:43
UWORD32 getDegree(void) const
Definition: Vertex.cc:155