In arrangements with only 1 thistle. More...

Namespaces
namespace	bits
	Details of algorithm for 1-Thistle MaxLA.

Functions
template<bool make_arrangement>
bits::result_t< make_arrangement >	AEF (const graphs::free_tree &t, const std::vector< properties::branchless_path > &all_paths, const array< std::size_t > &node_to_path) noexcept
	Maximal non-bipartite Arrangement with exactly 1 thistle vertex.

template<bool make_arrangement>
std::conditional_t< make_arrangement, std::pair< uint64_t, linear_arrangement >, uint64_t >	AEF (const graphs::free_tree &t, const std::vector< properties::branchless_path > &all_paths) noexcept
	Maximal non-bipartite Arrangement with exactly 1 thistle vertex.

Detailed Description

In arrangements with only 1 thistle.

Function Documentation

template<bool make_arrangement>

std::conditional_t< make_arrangement, std::pair< uint64_t, linear_arrangement >, uint64_t > lal::detail::DMax::thistle_1::AEF	(	const graphs::free_tree &	t,
		const std::vector< properties::branchless_path > &	all_paths )

inlinenodiscardnoexcept

Maximal non-bipartite Arrangement with exactly 1 thistle vertex.

This function implements the algorithm in [7].

Template Parameters

make_arrangement Boolean value that indicates whether or not the maximal arrangement should be constructed.

Parameters

t	Input tree.
all_paths	The set of all paths that span sequences of vertices of degree 2.

Returns: The cost of a maximal non-bipartite arrangement with exactly 1 thistle vertex.

Precondition: Input tree t must be a valid tree (see lal::graphs::tree::is_tree).