#include <DFSAPHeuristic.h>
Inheritance diagram for DFSAPHeuristic:

Public Member Functions | |
| DFSAPHeuristic (Graph *g, Matching *m, float goal=100.0, UWORD32 mne=UWORD32_MAX, EdgeIterator::ITERATIONMODE mo=EdgeIterator::SAMPLEOCCURENCE) | |
| virtual | ~DFSAPHeuristic (void) |
| const char * | getName (void) const |
| void | reset (UWORD32 mne=UWORD32_MAX, EdgeIterator::ITERATIONMODE mo=EdgeIterator::SAMPLEOCCURENCE) |
| void | run (void) |
Private Member Functions | |
| unsigned long | searchAugmentingPath (Vertex *v0, const Edge **path) |
| const Edge * | getNextEdge (Vertex *v) |
| void | markVisited (Vertex *v) |
| bool | isVisited (Vertex *v) const |
| bool | isVisited (VertexLabel vlbl) const |
Private Attributes | |
| UWORD32 | TimeCounter |
| UWORD32 * | TimeCounters |
| bool * | VertexOnPath |
| EdgeIterator * | EdgeIterators |
|
||||||||||||||||||||||||
|
construct an DFSAPHeuristic object
|
|
|
|
|
|
Implements MatchingAlgorithm. |
|
|
|
|
|
|
|
|
returns true iff v has already been visited in this iteration, i.e. in the current call of searchAugmentingPath |
|
|
|
|
||||||||||||
|
reset the state of this DFSAPHeuristic, esp. the EdgeIterators
|
|
|
Implements MatchingAlgorithm. |
|
||||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1.3.7