Go to the documentation of this file.
21 #ifndef SH_WKSCONSTRUCTIONHEURISTIC_H
22 #define SH_WKSCONSTRUCTIONHEURISTIC_H
59 {
return "Weighted Karp&Sipser Construction Heuristic" ; } ;
79 void print (
unsigned short spc = 0) ;
105 #endif // ndef SH_WKSCONSTRUCTIONHEURISTIC_H
represent a matching on a graph
Definition: Matching.h:41
a comparison operator
Definition: WKSConstructionHeuristic.h:73
std::priority_queue< Vertex *, std::vector< Vertex * >, LongerShortestEdge > VerticesDegG
contains all vertices with degree greater than 1
Definition: WKSConstructionHeuristic.h:102
virtual ~WKSConstructionHeuristic(void)
Definition: WKSConstructionHeuristic.h:56
Definition: MatchingAlgorithm.h:27
bool operator()(const Vertex *v1, const Vertex *v2)
Definition: WKSConstructionHeuristic.cc:172
std::priority_queue< Vertex *, std::vector< Vertex * >, LongerShortestEdge > VerticesDeg1
contains all vertices of degree 1 - every vertex in this queue has a correct shortest edge if it stil...
Definition: WKSConstructionHeuristic.h:100
WKSConstructionHeuristic(Graph *g, Matching *m, float goal=100.0)
Definition: WKSConstructionHeuristic.cc:27
void run(void)
Definition: WKSConstructionHeuristic.cc:52
Vertex * findVertexDegG(void)
Definition: WKSConstructionHeuristic.cc:124
Vertex * findVertexDeg1(void)
Definition: WKSConstructionHeuristic.cc:153
const char * getName(void) const
Definition: WKSConstructionHeuristic.h:58
prints the progress to stdout
Definition: ProgressOutput.h:32
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
void checkNeighboursDeg1(Vertex *v)
Definition: WKSConstructionHeuristic.cc:98
a heuristic algorithm for constructing a matching
Definition: WKSConstructionHeuristic.h:48