#include <WKSConstructionHeuristic.h>
Inheritance diagram for WKSConstructionHeuristic:

Public Member Functions | |
| WKSConstructionHeuristic (Graph *g, Matching *m, float goal=100.0) | |
| virtual | ~WKSConstructionHeuristic (void) |
| const char * | getName (void) const |
| void | run (void) |
Private Member Functions | |
| Vertex * | findVertexDeg1 (void) |
| Vertex * | findVertexDegG (void) |
| void | checkNeighboursDeg1 (Vertex *v) |
Private Attributes | |
| 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 still has degree 1 | |
| std::priority_queue< Vertex *, std::vector< Vertex * >, LongerShortestEdge > | VerticesDegG |
| contains all vertices with degree greater than 1 | |
|
||||||||||||||||
|
|
|
|
|
|
|
copy all Neighbours of v that have degree 1 to VerticesDeg1 |
|
|
get the Vertex from VerticesDeg1 that is nearest to top (with updated degrees and shortest edges) |
|
|
get the Vertex from VerticesDegG that is nearest to top (with updated degrees and shortest edges) |
|
|
Implements MatchingAlgorithm. |
|
|
Implements MatchingAlgorithm. |
|
|
|
|
|
|
1.3.7