lal::detail::DMax::bipartite Namespace Reference

In bipartite arrangements. More...

Functions
template<bool make_arrangement, class graph_t >
std::conditional_t< make_arrangement, std::pair< uint64_t, linear_arrangement >, uint64_t >	AEF (const graph_t &g, const properties::bipartite_graph_coloring &c) noexcept
	Maximum Bipartite Arrangement.
template<bool make_arrangement, class graph_t >
std::conditional_t< make_arrangement, std::pair< uint64_t, linear_arrangement >, uint64_t >	AEF (const graph_t &g) noexcept
	Maximum Bipartite Arrangement.

Detailed Description

In bipartite arrangements.

Function Documentation

AEF() [1/2]

template<bool make_arrangement, class graph_t >

std::conditional_t< make_arrangement, std::pair< uint64_t, linear_arrangement >, uint64_t > lal::detail::DMax::bipartite::AEF ( const graph_t & g )

inlinenodiscardnoexcept

Maximum Bipartite Arrangement.

Algorithm by Alemany, Ferrer-i-Cancho and Esteban [7].

Template Parameters

make_arrangement	Boolean value that indicates whether or not the maximal arrangement should be constructed.
graph_t	Type of graph. Any subclass of lal::graphs::graph.

Parameters

g	Input (bipartite) graph.

Returns

The cost of a maximum bipartite arrangement and possibly the arrangement that attains it.

Precondition

The input graph is a bipartite graph.

AEF() [2/2]

template<bool make_arrangement, class graph_t >

std::conditional_t< make_arrangement, std::pair< uint64_t, linear_arrangement >, uint64_t > lal::detail::DMax::bipartite::AEF ( const graph_t & g, const properties::bipartite_graph_coloring & c )

inlinenodiscardnoexcept

Maximum Bipartite Arrangement.

Algorithm by Alemany, Ferrer-i-Cancho and Esteban [7].

Template Parameters

make_arrangement	Boolean value that indicates whether or not the maximal arrangement should be constructed.
graph_t	Type of graph. Any subclass of lal::graphs::graph.

Parameters

g	Input (bipartite) graph.
c	Bipartite coloring of the input graph.

Returns

The cost of a maximum bipartite arrangement and possibly the arrangement that attains it.

Precondition

The input graph is a bipartite graph.