79 template <
class GT,
class SA = Dft_Show_Arc<GT> >
87 for (
int k = 0;
k < n;
k++)
89 for (
int i = 0; i < n; i++)
90 for (
int j = 0; j < n; j++)
112 template <
class GT,
class SA = Dft_Show_Arc<GT> >
Bit matrix for graph connectivity.
size_t get_num_nodes() const noexcept
Get number of nodes (matrix dimension)
GT * get_list_graph() noexcept
Get pointer to associated graph (nullptr if none)
void set_list_graph(GT &g)
Associate with a graph.
Computes the transitive closure of a graph using Warshall's algorithm.
void operator()(GT &g, Bit_Mat_Graph< GT > &mat) const
Invokes the computation of the transitive closure of a graph.
void warshall_compute_transitive_clausure(GT &g, Bit_Mat_Graph< GT, SA > &mat)
Computes the transitive closure of a graph using Warshall's algorithm.
Main namespace for Aleph-w library functions.
and
Check uniqueness with explicit hash + equality functors.
Divide_Conquer_DP_Result< Cost > divide_and_conquer_partition_dp(const size_t groups, const size_t n, Transition_Cost_Fn transition_cost, const Cost inf=dp_optimization_detail::default_inf< Cost >())
Optimize partition DP using divide-and-conquer optimization.
Generic graph and digraph implementations.
Adjacency matrix representations for graphs.