LAL: Linear Arrangement Library 24.10.00
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 123456]
 NlalMain namespace of the library
 NdetailDetail namespace
 NDMaxNamespace for algorithms to calculate the maximum sum of edge lengths
 NplanarIn planar arrangements
 NunconstrainedIn unconstrained arrangements
 NsortingSorting algorithms
 NcountingsortTypes used only by the counting sort algorithm
 Csorted_vectorSorted vector class
 Carrangement_wrapperA wrapper to easily use identity arrangements
 CarrayWrapper of a C array for automatic deallocation of memory
 CAVLSimple class that implements an AVL tree
 CfrequenciesFrequency of a value in the tree v
 Ctree_nodeNode of the tree
 CBFSAbstract graph Breadth-First Search traversal
 Cbool_sequenceA sequence of Boolean values
 Cchunks_AndersonImplementation of Anderson's algorithm for chunking
 Cchunks_genericBasic algorithms existent in every definition of chunking
 Cchunks_MacutekImplementation of Mačutek's algorithm for chunking
 Cconditional_listGeneralization of std::conditional_list
 Cedge_sizeStruct used in many algorithms to sort edges according to some integer value
 Cfirst_trueFrom a list of Boolean values, find the first that is set to true
 C_ft_implImplementation of first_true
 C_ft_impl< idx, v >Implementation of first_true
 Cis_pointer_iteratorDecide if a type is a pointer or iterator to another
 Cith_typeSelection of the ith type of a list of types
 C_ith_type_implImplementation of ith_type
 C_ith_type_impl< cur_idx, t1 >Implementation of ith_type. Partial template specialization
 Cith_type< ith_idx, type_sequence< Ts... > >Partial template specialization of ith_type for type_sequence
 Clevel_signatureA class that implements level signatures of an array
 Cnode_sizeStruct used in many algorithms to sort vertices according to some integer value
 Cqueue_arraySimple array-like fixed-size queue
 Cset_arrayA set-like data structure implemented with an array
 Ctype_sequenceA sequence of types
 NgenerateGeneration of different classes of objects
 C_rand_lab_free_treesUniformly random selection of labelled free trees
 C_rand_lab_rooted_treesUniformly random selection of labelled rooted trees
 C_rand_ulab_free_treesUniformly random selection of unlabelled free trees
 C_rand_ulab_rooted_treesUniformly random selection of unlabelled rooted trees
 C_tree_generatorBase class for tree generators
 Call_arrangementsExhaustive enumeration of arrangements of any graph
 Call_bipartite_arrangementsExhaustive enumeration of all bipartite arrangements of any bipartite 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 free tree
 Call_projective_arrangementsExhaustive enumeration of projective arrangements of a rooted tree
 Call_ulab_free_bistar_treesExhaustive enumeration of unlabelled free trees
 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_bipartite_arrangementsRandom generation of arrangements of any bipartite graph
 Crand_lab_free_treesUniformly random selection of labelled free trees
 Crand_lab_rooted_treesUniformly random selection of labelled rooted trees
 Crand_planar_arrangementsUniformly random selection of planar arrangements of a free tree
 Crand_projective_arrangementsUniformly random selection of projective arrangements of a rooted tree
 Crand_ulab_free_treesUniformly random selection of unlabelled free trees
 Crand_ulab_rooted_treesUniformly random selection 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_treebank_processor_baseThe processor base class
 Chead_vector_errorHead vector error report class
 Ctreebank_collection_processorAutomatic processing of treebank collections
 Ctreebank_collection_readerA reader for a collection of treebanks
 Ctreebank_collection_reportReport on a treebank collection
 Ctreebank_collection_report_locationAn auxiliary struct in replacement of std::tuple
 Ctreebank_file_errorTreebank file error report class
 Ctreebank_file_reportReport on a treebank file
 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
 CchunkDefinition of a chunk
 Cchunk_sequenceChunk sequence of a syntactic dependency tree
 Cdependency_fluxDependency flux
 NnumericNumeric namespace
 CintegerArbitrary precision integer
 CrationalExact rational number
 NpropertiesNamespace for all linear-arrangement-independent algorithms
 Cbipartite_graph_coloringA class to represent a coloring of the vertices of a bipartite graph
 Cbranchless_pathBranchless paths in trees
 Cconnected_componentsThe connected components of a graph
 Clinear_arrangementLinear arrangement of vertices
 Cnode_tTypesafe node type
 Cposition_tTypesafe position type