LIMA
Libre Multilingual Analyzer — C++ API
Loading...
Searching...
No Matches
Classes | Static Public Member Functions | List of all members
deeplima::impl::ArborescenceHeads< vertex_idx_t, weight_t > Class Template Reference

#include <deeplima/graph_dp/impl/arborescence.h>

Static Public Member Functions

static size_t count_roots (typename std::vector< vertex_idx_t >::const_iterator pos, typename std::vector< vertex_idx_t >::const_iterator end)
 A node is a root if its head id is 0.
 
static bool is_connected (typename std::vector< vertex_idx_t >::const_iterator pos, typename std::vector< vertex_idx_t >::const_iterator end)
 
static void find_disconnected_groups (const std::vector< std::vector< size_t > > &head2child, size_t len, std::vector< size_t > &accessibility_map)
 
static void find_loops (const std::vector< vertex_idx_t > &heads, std::vector< std::vector< size_t > > &loops, const std::vector< size_t > &connected, size_t len, size_t offset)
 
static void choose_one_root (std::vector< vertex_idx_t > &heads, size_t offset)
 
static void choose_root (std::vector< vertex_idx_t > &heads, size_t offset)
 

Detailed Description

template<typename vertex_idx_t, typename weight_t>
class deeplima::impl::ArborescenceHeads< vertex_idx_t, weight_t >

Definition at line 568 of file arborescence.h.

Member Function Documentation

◆ choose_one_root()

template<typename vertex_idx_t , typename weight_t >
static void deeplima::impl::ArborescenceHeads< vertex_idx_t, weight_t >::choose_one_root ( std::vector< vertex_idx_t > &  heads,
size_t  offset 
)
inlinestatic

Definition at line 793 of file arborescence.h.

◆ choose_root()

template<typename vertex_idx_t , typename weight_t >
static void deeplima::impl::ArborescenceHeads< vertex_idx_t, weight_t >::choose_root ( std::vector< vertex_idx_t > &  heads,
size_t  offset 
)
inlinestatic

Definition at line 835 of file arborescence.h.

◆ count_roots()

template<typename vertex_idx_t , typename weight_t >
static size_t deeplima::impl::ArborescenceHeads< vertex_idx_t, weight_t >::count_roots ( typename std::vector< vertex_idx_t >::const_iterator  pos,
typename std::vector< vertex_idx_t >::const_iterator  end 
)
inlinestatic

A node is a root if its head id is 0.

Definition at line 607 of file arborescence.h.

◆ find_disconnected_groups()

template<typename vertex_idx_t , typename weight_t >
static void deeplima::impl::ArborescenceHeads< vertex_idx_t, weight_t >::find_disconnected_groups ( const std::vector< std::vector< size_t > > &  head2child,
size_t  len,
std::vector< size_t > &  accessibility_map 
)
inlinestatic

Definition at line 662 of file arborescence.h.

◆ find_loops()

template<typename vertex_idx_t , typename weight_t >
static void deeplima::impl::ArborescenceHeads< vertex_idx_t, weight_t >::find_loops ( const std::vector< vertex_idx_t > &  heads,
std::vector< std::vector< size_t > > &  loops,
const std::vector< size_t > &  connected,
size_t  len,
size_t  offset 
)
inlinestatic

Definition at line 688 of file arborescence.h.

◆ is_connected()

template<typename vertex_idx_t , typename weight_t >
static bool deeplima::impl::ArborescenceHeads< vertex_idx_t, weight_t >::is_connected ( typename std::vector< vertex_idx_t >::const_iterator  pos,
typename std::vector< vertex_idx_t >::const_iterator  end 
)
inlinestatic

Definition at line 622 of file arborescence.h.

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