21#ifndef SH_DMDCONSTRUCTIONHEURISTIC_H
22#define SH_DMDCONSTRUCTIONHEURISTIC_H
39 {
return "Dynamic Minimum Degree Construction Heuristic" ; } ;
an implementation of the "dynamic minimum degree" heuristic for contruction a matching
Definition DMDConstructionHeuristic.h:32
VertexLabel findMinDegIndex(const std::vector< Vertex * > &vertices)
Definition DMDConstructionHeuristic.cc:56
static const VertexLabel MinDegNotFound
Definition DMDConstructionHeuristic.h:44
void run(void)
Definition DMDConstructionHeuristic.cc:36
DMDConstructionHeuristic(Graph *g, Matching *m, float goal=100.0)
Definition DMDConstructionHeuristic.cc:27
std::vector< Vertex * > AvailableVertices
Definition DMDConstructionHeuristic.h:46
const char * getName(void) const
Definition DMDConstructionHeuristic.h:38
virtual ~DMDConstructionHeuristic(void)
Definition DMDConstructionHeuristic.h:36
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
a vertex in a graph
Definition Vertex.h:43
#define VERTEXLABEL_MAX
Definition common.h:73
UWORD32 VertexLabel
Definition common.h:68