Collaboration diagram for fastEdmonds:

Classes
struct	BridgePair
Public Member Functions
	fastEdmonds (Graph &, Dlist &, int &)
string &	statString (bool, string &)
	Create string containing statistics.
Private Types
enum	stype { unreached, odd, even }
Private Member Functions
vertex	nca (vertex, vertex)
edge	path (vertex, vertex)
void	augment (edge)
edge	findpath ()
Private Attributes
Graph *	graf
	graph we're finding matching for
Dlist *	match
	matching we're building
Partition *	blossoms
	partition of the vertices into blossoms
RlistSet *	augpath
	reversible list used to construct path
vertex *	origin
	origin[u] is the original vertex corresponding to a blossom
BridgePair *	bridge
	for innermost blossom containing u bridge[u].v identifies the endpoint of the edge that is u's descendant
stype *	state
	state used in computation path search
edge *	mEdge
	mEdge[u] is matching edge incident to u
edge *	pEdge
	p[u] is parent of u in forest
bool *	mark
	used in nearest common ancestor computation
int	searchNum
	number of current path search
int *	latestSearch
	latestSearch[u] == searchNum <=> u is reached
edge *	nextEdge
	nextEdge[u] is next edge to search at u
List *	pending
	list of vertices used by findpath
Dlist *	unmatched
	list of unmatched vertices
int	iSize
int	mSize
int	stepCount
int	blossomCount
int	imatchTime
int	rmatchTime
int	pathInitTime
int	pathFindTime

Detailed Description

Definition at line 17 of file fastEdmonds.h.

Member Function Documentation

string & fastEdmonds::statString	(	bool	verbose,
		string &	s
	)

Create string containing statistics.

Parameters:

verbose	if true, return fully labeled string; otherwise returned string contains just the values
s	is reference to string in which result is returned

Definition at line 278 of file fastEdmonds.cpp.

The documentation for this class was generated from the following files: