dmdconstructionheuristic(3)
NAME
DMDConstructionHeuristic - an implementation of the 'dynamic minimum
degree' heuristic for contruction a matching
SYNOPSIS
#include <DMDConstructionHeuristic.h> Inherits MatchingAlgorithm. Public Member Functions DMDConstructionHeuristic (Graph *g, Matching *m, float goal=100.0) virtual ~DMDConstructionHeuristic (void) const char * getName (void) const void run (void) Private Member Functions VertexLabel findMinDegIndex (const std::vector< Vertex * > &vertices) Private Attributes std::vector< Vertex * > AvailableVertices Static Private Attributes static const VertexLabel MinDegNotFound = VERTEXLABEL_MAX
Constructor & Destructor Documentation
- DMDConstructionHeuristic::DMDConstructionHeuristic (Graph * g, Matching *
- m, float goal = 100.0)
- virtual DMDConstructionHeuristic::~DMDConstructionHeuristic (void) [inline,
- virtual]
Member Function Documentation
- const char* DMDConstructionHeuristic::getName (void) const [inline,
- virtual]
Implements MatchingAlgorithm. - void DMDConstructionHeuristic::run (void) [virtual]
- Implements MatchingAlgorithm.
- VertexLabel DMDConstructionHeuristic::findMinDegIndex (const std::vector<
- Vertex * > & vertices) [private]
Member Data Documentation
- const VertexLabel DMDConstructionHeuristic::MinDegNotFound =
- VERTEXLABEL_MAX [static, private]
- std::vector<Vertex*> DMDConstructionHeuristic::AvailableVertices [private]
Author
- Generated automatically by Doxygen for steghide from the source code.