Namespace List

Here is a list of all documented namespaces with brief descriptions:

[detail level 123456]

▼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
Nbrute_force	Namespace for the brute force algorithm to calculate \(C\)
Ndyn_prog	Namespace for the dynamic programming algorithm to calculate \(C\)
Nladder	Namespace for the "ladder" algorithm to calculate \(C\)
Nstack_based	Namespace for the stack-based algorithm to calculate \(C\)
►NDMax	Namespace for algorithms to calculate the maximum sum of edge lengths
Nbipartite	In bipartite arrangements
►Nplanar	In planar arrangements
Cedge_size_sigma	A tuple used to construct the sorted adjacency list
Csorted_adjacency_list_info	A piece of information within u's list
Nprojective	In projective arrangements
►Nthistle_1	In arrangements with only 1 thistle
Nbits	Details of algorithm for 1-Thistle MaxLA
►Nunconstrained	In unconstrained arrangements
►CAEF_BnB	A Branch and Bound algorithm for the maximum sum of edge lengths
Cindexer_edge	A helper class to be able to store edges in m_E_p, m_E_ps, m_E_s
Cpath_info	Data related to paths in the tree
Cset_maximum_arrangements	Set of maximum arrangements up to isomorphism
NDMax_utils	Utilities for the various maximum linear arrangement algorithms
►NDmin	Namespace for algorithms to calculate the minimum sum of edge lengths
Nbipartite	In bipartite arrangements
Nplanar	In planar arrangements
Nprojective	In projective arrangements
►Nunconstrained	In unconstrained arrangements
NChung	Functions for Chung's minimum linear arrangement algorithm
NShiloach	Functions for Shiloach's minimum linear arrangement algorithm
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
Ncaterpillar	Algorithms for caterpillar trees
►Nsorting	Sorting algorithms
►Ncountingsort	Types used only by the counting sort algorithm
Cmemory	Memory used for the counting sort algorithm
Csorted_vector	Sorted vector class
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
Cfrequencies	Frequency of a value in the tree v
Ctree_node	Node of the 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
C_ft_impl	Implementation of first_true
C_ft_impl< idx, v >	Implementation of first_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
C_ith_type_impl	Implementation 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_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