BFSAPHeuristic Class Reference

a matching algorithm implementing a heuristic breadth-first-search for augmenting paths

#include <BFSAPHeuristic.h>

Inheritance diagram for BFSAPHeuristic:

MatchingAlgorithm

List of all members.

Public Member Functions

 BFSAPHeuristic (Graph *g, Matching *m)
virtual ~BFSAPHeuristic (void)
const char * getName (void) const
void run (void)

Private Member Functions

unsigned long searchAugmentingPath (Vertex *v0, const Edge **path)

Private Attributes

bool * VertexVisited
EdgeBackEdge


Constructor & Destructor Documentation

BFSAPHeuristic::BFSAPHeuristic ( Graph g,
Matching m 
)

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]

Implements MatchingAlgorithm.

void BFSAPHeuristic::run ( void   )  [virtual]

Implements MatchingAlgorithm.

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

bool* BFSAPHeuristic::VertexVisited [private]

Edge* BFSAPHeuristic::BackEdge [private]


The documentation for this class was generated from the following files:
Generated on Thu Jan 3 18:39:33 2008 for steghide by  doxygen 1.5.4