a matching algorithm implementing a heuristic breadth-first-search for augmenting paths
#include <BFSAPHeuristic.h>
◆ BFSAPHeuristic()
construct an BFSAPHeuristic object
- Parameters
-
g | the graph on which this heuristic should run |
m | the matching to start with |
◆ ~BFSAPHeuristic()
BFSAPHeuristic::~BFSAPHeuristic |
( |
void |
| ) |
|
|
virtual |
◆ getName()
const char * BFSAPHeuristic::getName |
( |
void |
| ) |
const |
|
inlinevirtual |
◆ run()
void BFSAPHeuristic::run |
( |
void |
| ) |
|
|
virtual |
◆ searchAugmentingPath()
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)
◆ BackEdge
Edge* BFSAPHeuristic::BackEdge |
|
private |
◆ VertexVisited
bool* BFSAPHeuristic::VertexVisited |
|
private |
The documentation for this class was generated from the following files: