auction algorithm for find match in weighted bipartited graph More...

#include <plugin_auction.h>

Inherits query_base.

Public Member Functions
	REGISTER_QUERY_TYPE (analytic_auction)

void	options (command_options &opt)

int	run (struct query_param_type)

bool	sanity_check (graph_type *g)

void	auction (graph_type g, internal_outputFormat o, const string &wt_prop, size_t num, float eps)

Detailed Description

auction algorithm for find match in weighted bipartited graph

Parameters

–graph	a bipartite graph
–bipartite_check	check if the graph is directed bipartite graph
–prop	the edge property storing the edge weight
–num	[optional] the maximum allowed interations
–eps	[optional] the epsilon used in auction

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

Public Member Functions