Global namespace for GEDLIB. More...

Namespaces
	util
	Contains miscellaneous utility functions.

Classes
class	AnchorAwareGED
	Computes the exact graph edit distance for general edit costs. More...

class	Bipartite
	Computes lower and upper bounds for general edit costs. More...

class	BipartiteML
	Uses characteristics of an LSAPE instance for defining feature vectors for node edit operations. More...

class	BLPNoEdgeLabels
	Binary linear programming formulation of the graph edit distance without edge labels. More...

class	BPBeam
	Computes an upper bound for general edit costs. More...

class	Branch
	Computes lower and upper bounds for general edit costs. More...

class	BranchCompact
	Computes a lower bound for uniform edit costs. More...

class	BranchFast
	Computes lower and upper bounds for general edit costs. More...

class	BranchTight
	Computes lower and upper bounds for general edit costs. More...

class	BranchUniform
	Computes lower and upper bounds for uniform edit costs. More...

class	CHEM1
	Edit cost functions for chemical graphs such as the ones contained in the datasets Mutagenicity, AIDS, PAH, MAO, Alkane, and Acyclic. More...

class	CHEM2
	Edit cost functions for chemical graphs such as the ones contained in the datasets Mutagenicity, AIDS, PAH, MAO, Alkane, and Acyclic. More...

class	CMU
	Edit costs for graphs contain in CMU dataset. More...

class	CompactMIP
	Mixed integer linear programming formulation of the graph edit distance. More...

class	Constant
	Implements constant edit cost functions. More...

class	EditCosts
	Abstract class for defining edit cost functions. More...

class	Error
	Runtime error class. More...

struct	ExchangeGraph
	Simple graph class used for communication with user. More...

class	F1
	Mixed integer linear programming formulation of the graph edit distance. More...

class	F2
	Mixed integer linear programming formulation of the graph edit distance. More...

class	Fingerprint
	Edit costs for graphs contained in Fingerprint dataset. More...

class	GEDData
	Contains the standardized input data along with basic functionality. More...

class	GEDEnv
	Provides the API of GEDLIB. More...

class	GEDGraph
	The normalized input graphs used by GEDLIB. All labels are integers. More...

class	GEDMethod
	Abstract class for the (suboptimal) computation of the graph edit distance. More...

class	GREC1
	Edit cost functions for the dataset GREC. More...

class	GREC2
	Edit cost functions for the dataset GREC. More...

class	HED
	Computes a lower bound for general edit costs. More...

class	Hybrid
	Computes a lower bound for uniform edit costs. More...

class	IPFP
	Computes an upper bound for general edit costs. More...

class	Letter
	Edit costs for graphs contained in Letter datasets. More...

class	LSAPEBasedMethod
	Abstract class for methods that use lossy transformations to LSAPE for approximating the graph edit distance. More...

class	LSAPESolver
	This class solves LSAPE instances by calling the library lsape available at https://bougleux.users.greyc.fr/lsape/. More...

class	LSAPSolver
	This class solves LSAP instances by calling the library lsape available at https://bougleux.users.greyc.fr/lsape/. More...

class	LSBasedMethod
	Abstract class for methods that use variants of local search for upper bounding the graph edit distance. More...

class	Matrix
	A matrix class with basic functionality. More...

class	MIPBasedMethod
	Abstract class for methods that use mixed integer linear programming for exactly or approximatively computing the graph edit distance. More...

class	MLBasedMethod
	Abstract class for methods that transform GED to LSAPE by using a SVM or a DNN to predict the cost of node edit operations. More...

class	Node
	Computes lower and upper bounds for general edit costs. More...

class	NodeMap
	A class for node maps. More...

struct	NoLabel
	Type of dummy labels for unlabeled nodes and edges. More...

struct	Options
	Contains enums for options employed by ged::GEDEnv. More...

class	Partition
	Computes a lower bound for uniform edit costs. More...

class	ProgressBar
	A progress bar class. More...

class	Protein
	Edit costs for graphs contained in Protein dataset. More...

class	Refine
	Computes an upper bound for general edit costs. More...

class	Result
	A wrapper structure for the result of calls to ged::GEDMethod::run_as_util() and ged::GEDMethod::ged_run_(). More...

class	Ring
	Computes an upper bound for general edit costs. More...

class	RingML
	Uses ring structures for defining feature vectors for node edit operations. More...

class	SimulatedAnnealing
	Uses LSAPE instances to approximate GED via simulated annealing. More...

class	Star
	Computes lower and upper bounds for uniform edit costs. More...

class	Subgraph
	Computes upper bounds for general edit costs. More...

class	Timer
	A timer class that can be used by methods that support time limits. More...

class	Walks
	Computes an upper bound for general edit costs. More...

Typedefs
typedef std::chrono::duration< double >	Seconds
	Internally used type for measurements in seconds.

typedef std::map< std::string, std::string >	GXLLabel
	Type of node and edge labels of graphs given in the .gxl file format.

typedef std::string	GXLNodeID
	Type of node IDs of graphs given in the .gxl file format.

typedef std::size_t	LabelID
	Internally used type of node and edge labels.

typedef Matrix< double >	DMatrix
	Matrix with double entries.

typedef Matrix< int >	IMatrix
	Matrix with int entries.

Functions
template<class Key , class Value >
std::ostream &	operator<< (std::ostream &os, const std::map< Key, Value > &map)
	Streams std::map. More...

constexpr LabelID	invalid_label ()
	Returns an invalid label. More...

constexpr LabelID	dummy_label ()
	Returns a dummy label. More...

constexpr std::size_t	undefined ()
	Returns undefined size. More...

constexpr double	pi ()
	Provides constant $\pi$ with double precision. More...

std::ostream &	operator<< (std::ostream &os, const Options::GEDMethod &ged_method)
	Streams Options::GEDMethod object. More...

Detailed Description

Global namespace for GEDLIB.

Function Documentation

◆ dummy_label()

constexpr LabelID ged::dummy_label ( )

Returns a dummy label.

Returns: Dummy label.

Definition at line 142 of file common_types.hpp.

◆ invalid_label()

constexpr LabelID ged::invalid_label ( )

Returns an invalid label.

Returns: Invalid label.

Definition at line 136 of file common_types.hpp.

◆ operator<<() [1/2]

template<class Key , class Value >

std::ostream& ged::operator<<	(	std::ostream &	os,
		const std::map< Key, Value > &	map
	)

Streams std::map.

Parameters

[in]	os	Output stream
[in]	map	Map that should be streamed.

Returns: Output stream.

Definition at line 106 of file common_types.hpp.

◆ operator<<() [2/2]

std::ostream& ged::operator<<	(	std::ostream &	os,
		const Options::GEDMethod &	ged_method
	)

Streams Options::GEDMethod object.

Parameters

[in]	os	Output stream.
[in]	ged_method	Method selector.

Returns: Output stream.

Definition at line 243 of file common_types.hpp.

◆ pi()

constexpr double ged::pi ( )

Provides constant $\pi$ with double precision.

Returns: Returns 3.141592653589793238463.

Definition at line 155 of file common_types.hpp.

◆ undefined()

constexpr std::size_t ged::undefined ( )

Returns undefined size.

Returns: Undefined size.

Definition at line 149 of file common_types.hpp.

Namespaces

Classes

Typedefs

Functions