BFSAPHeuristic Class Reference
a matching algorithm implementing a heuristic breadth-first-search for augmenting paths
#include <BFSAPHeuristic.h>
List of all members.
Constructor & Destructor Documentation
construct an BFSAPHeuristic object
- Parameters:
-
| g | the graph on which this heuristic should run |
| m | the matching to start with |
BFSAPHeuristic::~BFSAPHeuristic |
( |
void |
|
) |
[virtual] |
Member Function Documentation
const char* BFSAPHeuristic::getName |
( |
void |
|
) |
const [inline, virtual] |
void BFSAPHeuristic::run |
( |
void |
|
) |
[virtual] |
unsigned long BFSAPHeuristic::searchAugmentingPath |
( |
Vertex * |
v0, |
|
|
const Edge ** |
path | |
|
) |
| | [private] |
- Parameters:
-
| v0 | an exposed vertex |
| path | an array of Edge pointers where the path will be put |
- Returns:
- the length of the path (the number of valid edges in path)
Member Data Documentation
The documentation for this class was generated from the following files: