| ▼Cged::EditCosts< UserNodeLabel, UserEdgeLabel > | Abstract class for defining edit cost functions |
| Cged::CHEM1< UserNodeLabel, UserEdgeLabel > | Edit cost functions for chemical graphs such as the ones contained in the datasets Mutagenicity, AIDS, PAH, MAO, Alkane, and Acyclic |
| Cged::CHEM2< UserNodeLabel, UserEdgeLabel > | Edit cost functions for chemical graphs such as the ones contained in the datasets Mutagenicity, AIDS, PAH, MAO, Alkane, and Acyclic |
| Cged::CMU< UserNodeLabel, UserEdgeLabel > | Edit costs for graphs contain in CMU dataset |
| Cged::Constant< UserNodeLabel, UserEdgeLabel > | Implements constant edit cost functions |
| Cged::Fingerprint< UserNodeLabel, UserEdgeLabel > | Edit costs for graphs contained in Fingerprint dataset |
| Cged::GREC1< UserNodeLabel, UserEdgeLabel > | Edit cost functions for the dataset GREC |
| Cged::GREC2< UserNodeLabel, UserEdgeLabel > | Edit cost functions for the dataset GREC |
| Cged::Letter< UserNodeLabel, UserEdgeLabel > | Edit costs for graphs contained in Letter datasets |
| Cged::Protein< UserNodeLabel, UserEdgeLabel > | Edit costs for graphs contained in Protein dataset |
| Cged::Error | Runtime error class |
| Cged::ExchangeGraph< UserNodeID, UserNodeLabel, UserEdgeLabel > | Simple graph class used for communication with user |
| Cged::GEDData< UserNodeLabel, UserEdgeLabel > | Contains the standardized input data along with basic functionality |
| Cged::GEDEnv< UserNodeID, UserNodeLabel, UserEdgeLabel > | Provides the API of GEDLIB |
| Cged::GEDGraph | The normalized input graphs used by GEDLIB. All labels are integers |
| ▼Cged::GEDMethod< UserNodeLabel, UserEdgeLabel > | Abstract class for the (suboptimal) computation of the graph edit distance |
| Cged::AnchorAwareGED< UserNodeLabel, UserEdgeLabel > | Computes the exact graph edit distance for general edit costs |
| Cged::BranchCompact< UserNodeLabel, UserEdgeLabel > | Computes a lower bound for uniform edit costs |
| Cged::BranchTight< UserNodeLabel, UserEdgeLabel > | Computes lower and upper bounds for general edit costs |
| Cged::HED< UserNodeLabel, UserEdgeLabel > | Computes a lower bound for general edit costs |
| Cged::Hybrid< UserNodeLabel, UserEdgeLabel > | Computes a lower bound for uniform edit costs |
| ▼Cged::LSAPEBasedMethod< UserNodeLabel, UserEdgeLabel > | Abstract class for methods that use lossy transformations to LSAPE for approximating the graph edit distance |
| Cged::Bipartite< UserNodeLabel, UserEdgeLabel > | Computes lower and upper bounds for general edit costs |
| Cged::Branch< UserNodeLabel, UserEdgeLabel > | Computes lower and upper bounds for general edit costs |
| Cged::BranchFast< UserNodeLabel, UserEdgeLabel > | Computes lower and upper bounds for general edit costs |
| Cged::BranchUniform< UserNodeLabel, UserEdgeLabel > | Computes lower and upper bounds for uniform edit costs |
| ▼Cged::MLBasedMethod< UserNodeLabel, UserEdgeLabel > | Abstract class for methods that transform GED to LSAPE by using a SVM or a DNN to predict the cost of node edit operations |
| Cged::BipartiteML< UserNodeLabel, UserEdgeLabel > | Uses characteristics of an LSAPE instance for defining feature vectors for node edit operations |
| Cged::RingML< UserNodeLabel, UserEdgeLabel > | Uses ring structures for defining feature vectors for node edit operations |
| Cged::Node< UserNodeLabel, UserEdgeLabel > | Computes lower and upper bounds for general edit costs |
| Cged::Ring< UserNodeLabel, UserEdgeLabel > | Computes an upper bound for general edit costs |
| Cged::Star< UserNodeLabel, UserEdgeLabel > | Computes lower and upper bounds for uniform edit costs |
| Cged::Subgraph< UserNodeLabel, UserEdgeLabel > | Computes upper bounds for general edit costs |
| Cged::Walks< UserNodeLabel, UserEdgeLabel > | Computes an upper bound for general edit costs |
| ▼Cged::LSBasedMethod< UserNodeLabel, UserEdgeLabel > | Abstract class for methods that use variants of local search for upper bounding the graph edit distance |
| Cged::BPBeam< UserNodeLabel, UserEdgeLabel > | Computes an upper bound for general edit costs |
| Cged::IPFP< UserNodeLabel, UserEdgeLabel > | Computes an upper bound for general edit costs |
| Cged::Refine< UserNodeLabel, UserEdgeLabel > | Computes an upper bound for general edit costs |
| ▼Cged::MIPBasedMethod< UserNodeLabel, UserEdgeLabel > | Abstract class for methods that use mixed integer linear programming for exactly or approximatively computing the graph edit distance |
| Cged::BLPNoEdgeLabels< UserNodeLabel, UserEdgeLabel > | Binary linear programming formulation of the graph edit distance without edge labels |
| Cged::CompactMIP< UserNodeLabel, UserEdgeLabel > | Mixed integer linear programming formulation of the graph edit distance |
| Cged::F1< UserNodeLabel, UserEdgeLabel > | Mixed integer linear programming formulation of the graph edit distance |
| Cged::F2< UserNodeLabel, UserEdgeLabel > | Mixed integer linear programming formulation of the graph edit distance |
| Cged::Partition< UserNodeLabel, UserEdgeLabel > | Computes a lower bound for uniform edit costs |
| Cged::SimulatedAnnealing< UserNodeLabel, UserEdgeLabel > | Uses LSAPE instances to approximate GED via simulated annealing |
| Cged::LSAPESolver | This class solves LSAPE instances by calling the library lsape available at https://bougleux.users.greyc.fr/lsape/ |
| Cged::LSAPSolver | This class solves LSAP instances by calling the library lsape available at https://bougleux.users.greyc.fr/lsape/ |
| Cged::Matrix< ScalarT > | A matrix class with basic functionality |
| Cged::Matrix< double > | |
| Cged::Matrix< int > | |
| Cged::NodeMap | A class for node maps |
| Cged::NoLabel | Type of dummy labels for unlabeled nodes and edges |
| Cged::Options | Contains enums for options employed by ged::GEDEnv |
| Cged::ProgressBar | A progress bar class |
| Cged::Result | A wrapper structure for the result of calls to ged::GEDMethod::run_as_util() and ged::GEDMethod::ged_run_() |
| Cged::Timer | A timer class that can be used by methods that support time limits |
