an implementation of the "dynamic minimum degree" heuristic for contruction a matching
#include <DMDConstructionHeuristic.h>
DMDConstructionHeuristic::DMDConstructionHeuristic |
( |
Graph * |
g, |
|
|
Matching * |
m, |
|
|
float |
goal = 100.0 |
|
) |
| |
virtual DMDConstructionHeuristic::~DMDConstructionHeuristic |
( |
void |
| ) |
|
|
inlinevirtual |
VertexLabel DMDConstructionHeuristic::findMinDegIndex |
( |
const std::vector< Vertex * > & |
vertices | ) |
|
|
private |
const char* DMDConstructionHeuristic::getName |
( |
void |
| ) |
const |
|
inlinevirtual |
void DMDConstructionHeuristic::run |
( |
void |
| ) |
|
|
virtual |
std::vector<Vertex*> DMDConstructionHeuristic::AvailableVertices |
|
private |
The documentation for this class was generated from the following files: