LAL: Linear Arrangement Library 24.10.00
A library focused on algorithms on linear arrangements of graphs.
|
▼Nlal | Main namespace of the library |
▼Ndetail | Detail namespace |
Nbipartite_opt_utils | Utilities for the various optimal linear arrangement algorithms |
►Ncrossings | Namespace for the algorithms that compute the number of crossings |
►NDMax | Namespace for algorithms to calculate the maximum sum of edge lengths |
NDMax_utils | Utilities for the various maximum linear arrangement algorithms |
►NDmin | Namespace for algorithms to calculate the minimum sum of edge lengths |
NDmin_utils | Utilities for the various minimum linear arrangement algorithms |
NDopt_utils | Utilities for the various optimal linear arrangement algorithms |
►Nmaximum_subtrees | Algorithms to find maximum subtrees |
►Nsorting | Sorting algorithms |
Carrangement_wrapper | A wrapper to easily use identity arrangements |
Carray | Wrapper of a C array for automatic deallocation of memory |
►CAVL | Simple class that implements an AVL tree |
CBFS | Abstract graph Breadth-First Search traversal |
Cbool_sequence | A sequence of Boolean values |
Cchunks_Anderson | Implementation of Anderson's algorithm for chunking |
Cchunks_generic | Basic algorithms existent in every definition of chunking |
Cchunks_Macutek | Implementation of Mačutek's algorithm for chunking |
Cconditional_list | Generalization of std::conditional_list |
Cedge_size | Struct used in many algorithms to sort edges according to some integer value |
►Cfirst_true | From a list of Boolean values, find the first that is set to true |
Cis_pointer_iterator | Decide if a type is a pointer or iterator to another |
►Cith_type | Selection of the ith type of a list of types |
Cith_type< ith_idx, type_sequence< Ts... > > | Partial template specialization of ith_type for type_sequence |
Clevel_signature | A class that implements level signatures of an array |
Cnode_size | Struct used in many algorithms to sort vertices according to some integer value |
Cqueue_array | Simple array-like fixed-size queue |
Cset_array | A set-like data structure implemented with an array |
Ctype_sequence | A sequence of types |
▼Ngenerate | Generation of different classes of objects |
C_rand_lab_free_trees | Uniformly random selection of labelled free trees |
C_rand_lab_rooted_trees | Uniformly random selection of labelled rooted trees |
C_rand_ulab_free_trees | Uniformly random selection of unlabelled free trees |
C_rand_ulab_rooted_trees | Uniformly random selection of unlabelled rooted trees |
C_tree_generator | Base class for tree generators |
Call_arrangements | Exhaustive enumeration of arrangements of any graph |
Call_bipartite_arrangements | Exhaustive enumeration of all bipartite arrangements of any bipartite graph |
Call_lab_free_trees | Exhaustive enumeration of labelled free trees |
Call_lab_rooted_trees | Exhaustive enumeration of labelled rooted trees |
Call_planar_arrangements | Exhaustive enumeration of planar arrangements of a free tree |
Call_projective_arrangements | Exhaustive enumeration of projective arrangements of a rooted tree |
Call_ulab_free_bistar_trees | Exhaustive enumeration of unlabelled free trees |
Call_ulab_free_trees | Exhaustive enumeration of unlabelled free trees |
Call_ulab_rooted_trees | Exhaustive enumeration of unlabelled rooted trees |
Cexhaustive_random_type | Shorthand to get one of exhaustive_t or random_t |
Cexhaustive_t | Type for exhasutive enumeration of trees |
Clabelled_t | Type for labelled tree generation |
Clabelled_unlabelled_type | Shorthand to get one of labelled_t or unlabelled_t |
Crand_arrangements | Random generation of arrangements of any graph |
Crand_bipartite_arrangements | Random generation of arrangements of any bipartite graph |
Crand_lab_free_trees | Uniformly random selection of labelled free trees |
Crand_lab_rooted_trees | Uniformly random selection of labelled rooted trees |
Crand_planar_arrangements | Uniformly random selection of planar arrangements of a free tree |
Crand_projective_arrangements | Uniformly random selection of projective arrangements of a rooted tree |
Crand_ulab_free_trees | Uniformly random selection of unlabelled free trees |
Crand_ulab_rooted_trees | Uniformly random selection of unlabelled rooted trees |
Crandom_t | Type for random generation of trees |
Ctree_generator_type | Automatic tree generator type generator |
Cunlabelled_t | Type for unlabelled tree generation |
▼Ngraphs | Namespace for the graphs data structures |
Cdirected_graph | Directed graph class |
Cfree_tree | Free tree graph class |
Cgraph | Abstract class for graphs |
Crooted_tree | Rooted tree graph class |
Ctree | Tree graph class |
Cundirected_graph | Undirected graph class |
▼Nio | Input/Output functions and processing of treebanks |
C_treebank_processor_base | The processor base class |
Chead_vector_error | Head vector error report class |
Ctreebank_collection_processor | Automatic processing of treebank collections |
Ctreebank_collection_reader | A reader for a collection of treebanks |
Ctreebank_collection_report | Report on a treebank collection |
Ctreebank_collection_report_location | An auxiliary struct in replacement of std::tuple |
Ctreebank_file_error | Treebank file error report class |
Ctreebank_file_report | Report on a treebank file |
Ctreebank_processor | Automatic processing of treebank files |
Ctreebank_reader | A reader for a single treebank file |
▼Niterators | Iterators namespace |
CE_iterator | Iterator over the set of edges of a graph |
CQ_iterator | Iterator over the set of pairs of independent edges of a graph |
▼Nlinarr | Namespace for all linear-arrangement-dependent algorithms |
Cchunk | Definition of a chunk |
Cchunk_sequence | Chunk sequence of a syntactic dependency tree |
Cdependency_flux | Dependency flux |
▼Nnumeric | Numeric namespace |
Cinteger | Arbitrary precision integer |
Crational | Exact rational number |
▼Nproperties | Namespace for all linear-arrangement-independent algorithms |
Cbipartite_graph_coloring | A class to represent a coloring of the vertices of a bipartite graph |
Cbranchless_path | Branchless paths in trees |
Cconnected_components | The connected components of a graph |
Nutilities | Set of utilities |
Clinear_arrangement | Linear arrangement of vertices |
Cnode_t | Typesafe node type |
Cposition_t | Typesafe position type |