| ▼ lal | |
| ► detail | |
| ► generate | |
| make_arrangement.hpp | |
| ► graphs | |
| conversions.hpp | |
| cycles.hpp | |
| enumerate_sets.hpp | |
| is_tree.hpp | |
| reachability.hpp | |
| retrieve_subtrees.hpp | |
| size_subtrees.hpp | |
| traversal.hpp | |
| tree_classification.hpp | |
| tree_type.hpp | |
| union_find.hpp | |
| utils.hpp | |
| ► io | |
| check_correctness.hpp | |
| ► linarr | |
| ► C | |
| brute_force.hpp | |
| crossings.hpp | |
| dyn_prog.hpp | |
| ladder.hpp | |
| predict.hpp | |
| stack_based.hpp | |
| ► chunking | |
| Anderson.hpp | |
| generic.hpp | |
| Macutek.hpp | |
| ► D | |
| ► DMax | |
| ► unconstrained | |
| ► branch_and_bound | |
| ► AEF | |
| BnB.hpp | |
| level_value_propagation_origin.hpp | |
| next_action.hpp | |
| propagation_result.hpp | |
| reason_discard.hpp | |
| set_maximum_arrangements.hpp | |
| 1_eq_thistle_AEF.hpp | |
| Bipartite_AEF.hpp | |
| necessary_conditions.hpp | |
| Planar_AEF.hpp | |
| Projective_AEF.hpp | |
| utils.hpp | |
| ► Dmin | |
| Bipartite_AEF.hpp | |
| Planar_AEF.hpp | |
| Planar_HS.hpp | |
| Projective_AEF.hpp | |
| Projective_HS.hpp | |
| Unconstrained_FC.hpp | |
| Unconstrained_YS.hpp | |
| utils.hpp | |
| bipartite_opt_utils.hpp | |
| D.hpp | |
| Dopt_utils.hpp | |
| dependency_flux.hpp | |
| formal_constraints.hpp | |
| headedness.hpp | |
| level_signature.hpp | |
| syntactic_dependency_tree.hpp | |
| ► macros | |
| basic_convert.hpp | |
| search.hpp | |
| ► numeric | |
| utils.hpp | |
| ► properties | |
| bipartite_graph_colorability.hpp | |
| branchless_paths_compute.hpp | |
| connected_components_compute.hpp | |
| tree_centre.hpp | |
| tree_centroid.hpp | |
| tree_diameter.hpp | |
| tree_maximum_caterpillar.hpp | |
| ► sorting | |
| bit_sort.hpp | |
| counting_sort.hpp | |
| insertion_sort.hpp | |
| sorted_vector.hpp | |
| sorting_types.hpp | |
| ► type_traits | |
| bool_sequence.hpp | |
| conditional_list.hpp | |
| first_true.hpp | |
| is_pointer_iterator.hpp | |
| ith_type.hpp | |
| type_sequence.hpp | |
| ► utilities | |
| tree_isomorphism.hpp | |
| arrangement_wrapper.hpp | |
| array.hpp | |
| avl.hpp | |
| make_array.hpp | |
| pairs_utils.hpp | |
| queue_array.hpp | |
| set_array.hpp | |
| ► generate | |
| all_arrangements.hpp | |
| all_bipartite_arrangements.hpp | |
| all_lab_free_trees.hpp | |
| all_lab_rooted_trees.hpp | |
| all_planar_arrangements.hpp | |
| all_projective_arrangements.hpp | |
| all_ulab_free_bistar_trees.hpp | |
| all_ulab_free_trees.hpp | |
| all_ulab_rooted_trees.hpp | |
| rand_arrangements.hpp | |
| rand_bipartite_arrangements.hpp | |
| rand_lab_free_trees.hpp | |
| rand_lab_rooted_trees.hpp | |
| rand_planar_arrangements.hpp | |
| rand_projective_arrangements.hpp | |
| rand_ulab_free_trees.hpp | |
| rand_ulab_rooted_trees.hpp | |
| tree_generator.hpp | |
| tree_generator_type.hpp | |
| ► graphs | |
| conversions.hpp | |
| directed_graph.hpp | |
| free_tree.hpp | |
| graph.hpp | |
| output.hpp | |
| rooted_tree.hpp | |
| tree.hpp | |
| tree_literals.hpp | |
| tree_type.hpp | |
| undirected_graph.hpp | |
| ► io | |
| basic_output.hpp | |
| check_correctness.hpp | |
| edge_list.hpp | |
| head_vector.hpp | |
| head_vector_error.hpp | |
| head_vector_error_type.hpp | |
| treebank_collection_processor.hpp | |
| treebank_collection_reader.hpp | |
| treebank_collection_report.hpp | |
| treebank_collection_report_location.hpp | |
| treebank_feature_type.hpp | |
| treebank_file_error.hpp | |
| treebank_file_error_type.hpp | |
| treebank_file_report.hpp | |
| treebank_processor.hpp | |
| treebank_processor_base.hpp | |
| treebank_reader.hpp | |
| ► iterators | |
| E_iterator.hpp | |
| Q_iterator.hpp | |
| ► linarr | |
| ► aggregations | |
| 1level.hpp | |
| 2level.hpp | |
| ► C | |
| algorithms_C.hpp | |
| C.hpp | |
| ► chunking | |
| algorithms.hpp | |
| chunk.hpp | |
| chunk_sequence.hpp | |
| chunking.hpp | |
| output.hpp | |
| ► D | |
| algorithms_Dmin.hpp | |
| algorithms_Dmin_planar.hpp | |
| algorithms_Dmin_projective.hpp | |
| D.hpp | |
| DMax.hpp | |
| Dmin.hpp | |
| ► syntactic_dependency_tree | |
| classify.hpp | |
| type.hpp | |
| dependency_flux.hpp | |
| dependency_flux_compute.hpp | |
| formal_constraints.hpp | |
| head_initial.hpp | |
| ► numeric | |
| integer.hpp | |
| integer_output.hpp | |
| output.hpp | |
| rational.hpp | |
| rational_output.hpp | |
| ► properties | |
| bipartite_graph_colorability.hpp | |
| bipartite_graph_coloring.hpp | |
| branchless_path.hpp | |
| branchless_paths_compute.hpp | |
| C_rla.hpp | |
| connected_components.hpp | |
| connected_components_compute.hpp | |
| D_rla.hpp | |
| degrees.hpp | |
| hierarchical_distance.hpp | |
| maximum_spanning_trees.hpp | |
| Q.hpp | |
| tree_centre.hpp | |
| tree_centroid.hpp | |
| tree_diameter.hpp | |
| vertex_orbits.hpp | |
| ► utilities | |
| aggregations.hpp | |
| tree_isomorphism.hpp | |
| basic_types.hpp | |
| C.hpp | |
| D.hpp | |
| generate.hpp | |
| graphs.hpp | |
| io.hpp | |
| iterators.hpp | |
| lal_version.hpp | |
| linarr.hpp | |
| linear_arrangement.hpp | |
| numeric.hpp | |
| properties.hpp | |
| utilities.hpp | |