Go to the documentation of this file.
21 #ifndef SH_BFSAPHeuristic
22 #define SH_BFSAPHeuristic
48 {
return "BFS Augmenting Path Heuristic" ; } ;
64 #endif // ndef SH_BFSAPHeuristic
represent a matching on a graph
Definition: Matching.h:41
Edge * BackEdge
Definition: BFSAPHeuristic.h:61
unsigned long searchAugmentingPath(Vertex *v0, const Edge **path)
Definition: BFSAPHeuristic.cc:82
Definition: MatchingAlgorithm.h:27
bool * VertexVisited
Definition: BFSAPHeuristic.h:60
a matching algorithm implementing a heuristic breadth-first-search for augmenting paths
Definition: BFSAPHeuristic.h:36
BFSAPHeuristic(Graph *g, Matching *m)
Definition: BFSAPHeuristic.cc:28
virtual ~BFSAPHeuristic(void)
Definition: BFSAPHeuristic.cc:40
const char * getName(void) const
Definition: BFSAPHeuristic.h:47
a graph constructed from a cover file and a message to be embedded
Definition: Graph.h:51
a vertex in a graph
Definition: Vertex.h:43
void run(void)
Definition: BFSAPHeuristic.cc:46