|
LAL: Linear Arrangement Library 24.10.00
A library focused on algorithms on linear arrangements of graphs.
|
Main namespace of the library. More...
Namespaces | |
| namespace | detail |
| Detail namespace. | |
| namespace | generate |
| Generation of different classes of objects. | |
| namespace | graphs |
| Namespace for the graphs data structures. | |
| namespace | io |
| Input/Output functions and processing of treebanks. | |
| namespace | iterators |
| Iterators namespace. | |
| namespace | linarr |
| Namespace for all linear-arrangement-dependent algorithms. | |
| namespace | numeric |
| Numeric namespace. | |
| namespace | properties |
| Namespace for all linear-arrangement-independent algorithms. | |
| namespace | utilities |
| Set of utilities. | |
Classes | |
| class | linear_arrangement |
| Linear arrangement of vertices. More... | |
| struct | node_t |
| Typesafe node type. More... | |
| struct | position_t |
| Typesafe position type. More... | |
Typedefs | |
| typedef uint64_t | node |
| Node type. See Node / Vertex page for further details. | |
| typedef uint64_t | position |
| Node's position type. | |
| typedef std::pair< node, node > | edge |
| See Edge page for further details. | |
| typedef std::vector< uint64_t > | head_vector |
| See Head vector page for further details. | |
| typedef std::vector< edge > | edge_list |
| See Edge list page for further details. | |
| typedef std::pair< edge, edge > | edge_pair |
| Edge pair type. | |
| typedef std::vector< node > | neighbourhood |
| List of nodes. | |
| typedef std::pair< node_t, node_t > | edge_t |
| Similar to edge. | |
| typedef std::pair< edge_t, edge_t > | edge_pair_t |
| Similar to edge_pair. | |
Main namespace of the library.
This namespace groups all namespaces of the library. Each namespace classifies the classes and functions in categories.