Here is a list of all documented class members with links to the class documentation for each member:

- n -

• next() : lal::generate::all_arrangements, lal::generate::all_bipartite_arrangements, lal::generate::all_lab_free_trees, lal::generate::all_lab_rooted_trees, lal::generate::all_planar_arrangements, lal::generate::all_projective_arrangements, lal::generate::all_ulab_free_bistar_trees, lal::generate::all_ulab_free_trees, lal::generate::all_ulab_rooted_trees, lal::iterators::E_iterator< graph_t, is_directed, >, lal::iterators::Q_iterator< GRAPH, is_directed, >
• next_tree() : lal::io::treebank_reader
• next_treebank() : lal::io::treebank_collection_reader
• node_counter : lal::detail::AVL< T >::tree_node
• node_has_parent() : lal::graphs::rooted_tree
• node_to_chunk() : lal::detail::chunks_Anderson< arrangement_t >, lal::detail::chunks_generic< arrangement_t >
• node_was_visited() : lal::detail::BFS< graph_t, >
• nodes_m2_to_assign : lal::detail::DMax::unconstrained::AEF_BnB::path_info
• nodes_p2_to_assign : lal::detail::DMax::unconstrained::AEF_BnB::path_info
• normalize() : lal::graphs::directed_graph, lal::graphs::graph
• normalize_after_edge_addition() : lal::graphs::graph
• normalize_after_edge_removal() : lal::graphs::graph
• NOT_EXISTS : lal::detail::set_array< value_t, indexer_t >
• num_assigned_nodes : lal::detail::DMax::unconstrained::AEF_BnB::path_info
• num_assigned_nodes_m2 : lal::detail::DMax::unconstrained::AEF_BnB::path_info
• num_assigned_nodes_p2 : lal::detail::DMax::unconstrained::AEF_BnB::path_info
• num_nodes() : lal::detail::AVL< T >
• num_nodes_larger : lal::detail::AVL< T >::frequencies
• num_thistles : lal::detail::DMax::unconstrained::AEF_BnB::path_info
• num_true : lal::detail::bool_sequence< values >