Struct RcspSolver 

pub struct RcspSolver<Problem, LabelMeta: Meta, NodeWeight, EdgeWeight, BranchFilter>
where
    Problem: UserProblem<LabelMeta, NodeWeight, EdgeWeight, BranchFilter>,
{ /* private fields */ }

The solver structure holding the user problem and graph

Implementations

impl<Problem: UserProblem<LabelMeta, NodeWeight, EdgeWeight, BranchFilter>, LabelMeta: Meta, NodeWeight, EdgeWeight, BranchFilter> RcspSolver<Problem, LabelMeta, NodeWeight, EdgeWeight, BranchFilter>

pub fn new(problem: Problem) -> Self

pub fn get_graph(&self) -> &ProblemGraph<NodeWeight, EdgeWeight>

Returns reference to stored problem graph

pub fn get_graph_mut(&mut self) -> &mut ProblemGraph<NodeWeight, EdgeWeight>

Returns mutable reference to stored problem graph

pub fn get_problem_mut(&mut self) -> &mut Problem

Returns mutable reference to stored problem

pub fn get_problem(&self) -> &Problem

Returns reference to stored problem

impl<Problem: UserProblem<LabelMeta, NodeWeight, EdgeWeight, BranchFilter>, LabelMeta: Meta + InitialLabelGenerator<Problem>, NodeWeight, EdgeWeight, BranchFilter> RcspSolver<Problem, LabelMeta, NodeWeight, EdgeWeight, BranchFilter>

where NodeWeight: Debug + Clone,

pub fn find_paths<const EARLY_EXIT: bool>( &mut self, filters: &[BranchFilter], path_start_cost: f64, ) -> Vec<(f64, FeasiblePath)>

Primary function of solver. Finds RCSP for network and returns non dominated results

Return object is vector of (path cost, path) tuples