Go to the documentation of this file.
21 #ifndef SH_DMDCONSTRUCTIONHEURISTIC_H
22 #define SH_DMDCONSTRUCTIONHEURISTIC_H
39 {
return "Dynamic Minimum Degree Construction Heuristic" ; } ;
51 #endif // ndef SH_DMDCONSTRUCTIONHEURISTIC_H
an implementation of the "dynamic minimum degree" heuristic for contruction a matching
Definition: DMDConstructionHeuristic.h:32
represent a matching on a graph
Definition: Matching.h:41
DMDConstructionHeuristic(Graph *g, Matching *m, float goal=100.0)
Definition: DMDConstructionHeuristic.cc:27
std::vector< Vertex * > AvailableVertices
Definition: DMDConstructionHeuristic.h:46
Definition: MatchingAlgorithm.h:27
UWORD32 VertexLabel
Definition: common.h:68
const char * getName(void) const
Definition: DMDConstructionHeuristic.h:38
VertexLabel findMinDegIndex(const std::vector< Vertex * > &vertices)
Definition: DMDConstructionHeuristic.cc:56
static const VertexLabel MinDegNotFound
Definition: DMDConstructionHeuristic.h:44
#define VERTEXLABEL_MAX
Definition: common.h:73
void run(void)
Definition: DMDConstructionHeuristic.cc:36
virtual ~DMDConstructionHeuristic(void)
Definition: DMDConstructionHeuristic.h:36
a graph constructed from a cover file and a message to be embedded
Definition: Graph.h:51
a vertex in a graph
Definition: Vertex.h:43