LAL: Linear Arrangement Library 21.07.01
A library focused on algorithms on linear arrangements of graphs.
Loading...
Searching...
No Matches
Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 123]
 NlalMain namespace of the library
 NgenerateGeneration of different classes of objects
 C_rand_lab_free_treesUniformly random generation of labelled free trees
 C_rand_lab_rooted_treesUniformly random generation of labelled rooted trees
 C_rand_ulab_free_treesUniformly random generation of unlabelled free trees
 C_rand_ulab_rooted_treesUniformly random generation of unlabelled rooted trees
 C_tree_generatorBase class for tree generators
 Call_arrangementsExhaustive enumeration of arrangements of any graph
 Call_lab_free_treesExhaustive enumeration of labelled free trees
 Call_lab_rooted_treesExhaustive enumeration of labelled rooted trees
 Call_planar_arrangementsExhaustive enumeration of planar arrangements of a labeled free tree
 Call_projective_arrangementsExhaustive enumeration of projective arrangements of a labeled rooted tree
 Call_ulab_free_treesExhaustive enumeration of unlabelled free trees
 Call_ulab_rooted_treesExhaustive enumeration of unlabelled rooted trees
 Cexhaustive_random_typeShorthand to get one of exhaustive_t or random_t
 Cexhaustive_tType for exhasutive enumeration of trees
 Clabelled_tType for labelled tree generation
 Clabelled_unlabelled_typeShorthand to get one of labelled_t or unlabelled_t
 Crand_arrangementsRandom generation of arrangements of any graph
 Crand_lab_free_treesUniformly random generation of labelled free trees
 Crand_lab_rooted_treesUniformly random generation of labelled rooted trees
 Crand_planar_arrangementsUniformly random generation of planar arrangements of a labeled rooted tree
 Crand_projective_arrangementsUniformly random generation of projective arrangements of a labeled rooted tree
 Crand_ulab_free_treesUniformly random generation of unlabelled free trees
 Crand_ulab_rooted_treesUniformly random generation of unlabelled rooted trees
 Crandom_tType for random generation of trees
 Ctree_generator_typeAutomatic tree generator type generator
 Cunlabelled_tType for unlabelled tree generation
 NgraphsNamespace for the graphs data structures
 Cdirected_graphDirected graph class
 Cfree_treeFree tree graph class
 CgraphAbstract class for graphs
 Crooted_treeRooted tree graph class
 CtreeTree graph class
 Cundirected_graphUndirected graph class
 NioInput/Output functions and processing of treebanks
 C_process_treebank_baseThe processor base class
 Creport_treebank_collectionReport on a treebank collection
 Creport_treebank_fileReport on a treebank file
 Ctreebank_collection_processorAutomatic processing of treebank collections
 Ctreebank_collection_readerA reader for a collection of treebanks
 Ctreebank_errorTreebank error report class
 Ctreebank_processorAutomatic processing of treebank files
 Ctreebank_readerA reader for a single treebank file
 NiteratorsIterators namespace
 CE_iteratorIterator over the set of edges of a graph
 CQ_iteratorIterator over the set of pairs of independent edges of a graph
 NlinarrNamespace for all linear-arrangement-dependent algorithms
 Cdependency_fluxDependency flux
 NnumericNumeric namespace
 CintegerArbitrary precision integer
 CrationalExact rational number