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