| ▼Nged | Global namespace for GEDLIB |
| CAnchorAwareGED | Computes the exact graph edit distance for general edit costs |
| CBipartite | Computes lower and upper bounds for general edit costs |
| CBipartiteML | Uses characteristics of an LSAPE instance for defining feature vectors for node edit operations |
| CBLPNoEdgeLabels | Binary linear programming formulation of the graph edit distance without edge labels |
| CBPBeam | Computes an upper bound for general edit costs |
| CBranch | Computes lower and upper bounds for general edit costs |
| CBranchCompact | Computes a lower bound for uniform edit costs |
| CBranchFast | Computes lower and upper bounds for general edit costs |
| CBranchTight | Computes lower and upper bounds for general edit costs |
| CBranchUniform | Computes lower and upper bounds for uniform edit costs |
| CCHEM1 | Edit cost functions for chemical graphs such as the ones contained in the datasets Mutagenicity, AIDS, PAH, MAO, Alkane, and Acyclic |
| CCHEM2 | Edit cost functions for chemical graphs such as the ones contained in the datasets Mutagenicity, AIDS, PAH, MAO, Alkane, and Acyclic |
| CCMU | Edit costs for graphs contain in CMU dataset |
| CCompactMIP | Mixed integer linear programming formulation of the graph edit distance |
| CConstant | Implements constant edit cost functions |
| CEditCosts | Abstract class for defining edit cost functions |
| CError | Runtime error class |
| CExchangeGraph | Simple graph class used for communication with user |
| CF1 | Mixed integer linear programming formulation of the graph edit distance |
| CF2 | Mixed integer linear programming formulation of the graph edit distance |
| CFingerprint | Edit costs for graphs contained in Fingerprint dataset |
| CGEDData | Contains the standardized input data along with basic functionality |
| CGEDEnv | Provides the API of GEDLIB |
| CGEDGraph | The normalized input graphs used by GEDLIB. All labels are integers |
| CGEDMethod | Abstract class for the (suboptimal) computation of the graph edit distance |
| CGREC1 | Edit cost functions for the dataset GREC |
| CGREC2 | Edit cost functions for the dataset GREC |
| CHED | Computes a lower bound for general edit costs |
| CHybrid | Computes a lower bound for uniform edit costs |
| CIPFP | Computes an upper bound for general edit costs |
| CLetter | Edit costs for graphs contained in Letter datasets |
| CLSAPEBasedMethod | Abstract class for methods that use lossy transformations to LSAPE for approximating the graph edit distance |
| CLSAPESolver | This class solves LSAPE instances by calling the library lsape available at https://bougleux.users.greyc.fr/lsape/ |
| CLSAPSolver | This class solves LSAP instances by calling the library lsape available at https://bougleux.users.greyc.fr/lsape/ |
| CLSBasedMethod | Abstract class for methods that use variants of local search for upper bounding the graph edit distance |
| CMatrix | A matrix class with basic functionality |
| CMIPBasedMethod | Abstract class for methods that use mixed integer linear programming for exactly or approximatively computing the graph edit distance |
| CMLBasedMethod | Abstract class for methods that transform GED to LSAPE by using a SVM or a DNN to predict the cost of node edit operations |
| CNode | Computes lower and upper bounds for general edit costs |
| CNodeMap | A class for node maps |
| CNoLabel | Type of dummy labels for unlabeled nodes and edges |
| COptions | Contains enums for options employed by ged::GEDEnv |
| CPartition | Computes a lower bound for uniform edit costs |
| CProgressBar | A progress bar class |
| CProtein | Edit costs for graphs contained in Protein dataset |
| CRefine | Computes an upper bound for general edit costs |
| CResult | A wrapper structure for the result of calls to ged::GEDMethod::run_as_util() and ged::GEDMethod::ged_run_() |
| CRing | Computes an upper bound for general edit costs |
| CRingML | Uses ring structures for defining feature vectors for node edit operations |
| CSimulatedAnnealing | Uses LSAPE instances to approximate GED via simulated annealing |
| CStar | Computes lower and upper bounds for uniform edit costs |
| CSubgraph | Computes upper bounds for general edit costs |
| CTimer | A timer class that can be used by methods that support time limits |
| CWalks | Computes an upper bound for general edit costs |
