Function graph_algo_ptas::algorithm::dynamic_programming::solve::dp_solve

pub fn dp_solve(
    graph: &StableGraph<(), (), Undirected>,
    td: Option<TreeDecomposition>,
    prob: &DpProblem
) -> HashSet<usize>

Solves the given problem on the input graph using dynamic programming.

When td is None, an optimal tree decomposition is calculated and used for the algorithm.

The prob parameter specifies whether the problem is a minimization or maximization problem and contains the “recipe” for how to calculate the dynamic programming tables in order to arrive at the solution.