In unconstrained arrangements. More...

Namespaces
namespace	Chung
	Functions for Chung's minimum linear arrangement algorithm.

namespace	Shiloach
	Functions for Shiloach's minimum linear arrangement algorithm.

Functions
template<bool make_arrangement>
std::conditional_t< make_arrangement, std::pair< uint64_t, linear_arrangement >, uint64_t >	FanChung_2 (const graphs::free_tree &t) noexcept
	Calculates a minimum linear arrangment using Fan Chung's algorithm. More...

template<bool make_arrangement>
std::conditional_t< make_arrangement, std::pair< uint64_t, linear_arrangement >, uint64_t >	YossiShiloach (const graphs::free_tree &t) noexcept
	Calculates a minimum linear arrangment using Shiloach's algorithm. More...

Detailed Description

In unconstrained arrangements.

Function Documentation

◆ FanChung_2()

template<bool make_arrangement>

std::conditional_t< make_arrangement, std::pair< uint64_t, linear_arrangement >, uint64_t > lal::detail::Dmin::unconstrained::FanChung_2 ( const graphs::free_tree & t )

noexcept

Calculates a minimum linear arrangment using Fan Chung's algorithm.

See [11] for further details.

Template Parameters

make_arrangement Whether or not the arrangement should be constructed.

Parameters

t	Input free tree.

Returns: Either a pair of <cost, linear arrangement> or just the cost depending on the value of the template parameter make_arrangement.

◆ YossiShiloach()

template<bool make_arrangement>

std::conditional_t< make_arrangement, std::pair< uint64_t, linear_arrangement >, uint64_t > lal::detail::Dmin::unconstrained::YossiShiloach ( const graphs::free_tree & t )

noexcept

Calculates a minimum linear arrangment using Shiloach's algorithm.

See [34] for further details.