LAL: Linear Arrangement Library 24.10.00
A library focused on algorithms on linear arrangements of graphs.
Loading...
Searching...
No Matches
lal::detail::chunks_Macutek< arrangement_t > Class Template Reference

Implementation of Mačutek's algorithm for chunking. More...

#include <Macutek.hpp>

Inheritance diagram for lal::detail::chunks_Macutek< arrangement_t >:
lal::detail::chunks_generic< arrangement_t >

Public Member Functions

 chunks_Macutek (const graphs::rooted_tree &rt, const arrangement_t &arr) noexcept
 Constructor.
 
void chunk_input_tree () noexcept
 Main method of this class.
 
const linarr::chunk_sequenceget_chunk_sequence () const noexcept
 Returns a constant reference to the chunk sequence m_sequence.
 
linarr::chunk_sequence && retrieve_chunk_sequence () noexcept
 Moves the chunk sequence m_sequence.
 

Protected Member Functions

std::size_t node_to_chunk (const node u) const noexcept
 Returns the chunk index of node u.
 
void set_chunk_index (const node u, const std::size_t i) noexcept
 Sets the chunk index of node u to index i.
 

Private Types

typedef chunks_generic< arrangement_t > generic
 Useful typedef.
 

Private Member Functions

void set_parent_chunks () noexcept
 Set the parent node of all chunks.
 
void set_parent_chunk (linarr::chunk &c) noexcept
 Set the parent node of a chunks.
 
linarr::chunklast_chunk () noexcept
 Returns a reference to the last chunk in the sentence.
 

Private Attributes

linarr::chunk_sequence m_sequence
 The sequence of chunks obtained.
 
const uint64_t m_n
 Number of vertices of the tree.
 
const arrangement_t m_arr
 Linear arrangement.
 
const graphs::rooted_treem_rt
 Input rooted tree.
 

Detailed Description

template<class arrangement_t>
class lal::detail::chunks_Macutek< arrangement_t >

Implementation of Mačutek's algorithm for chunking.

Chunking applied to syntactic dependency trees alone (a.k.a., rooted trees).

See [35] for a complete definition of Mačutek (et al.)'s chunks.

Template Parameters
arr_tType of arrangement.

Constructor & Destructor Documentation

◆ chunks_Macutek()

template<class arrangement_t >
lal::detail::chunks_Macutek< arrangement_t >::chunks_Macutek ( const graphs::rooted_tree & rt,
const arrangement_t & arr )
inlinenoexcept

Constructor.

Parameters
rtInput rooted tree.
arrInput linear arrangement.

Member Function Documentation

◆ chunk_input_tree()

template<class arrangement_t >
void lal::detail::chunks_Macutek< arrangement_t >::chunk_input_tree ( )
inlinenoexcept

Main method of this class.

Calling this method will chunk the input rooted tree using Mačutek (et al.)'s definition.


The documentation for this class was generated from the following file: