Struct BoundedDiameterSpanningTree 

pub struct BoundedDiameterSpanningTree<G, W: WeightElement> { /* private fields */ }

Bounded Diameter Spanning Tree problem.

Given an undirected graph G = (V, E) with positive edge weights w(e), a weight bound B, and a diameter bound D, determine whether G contains a spanning tree T such that the total weight of T is at most B and the diameter of T (the longest shortest path measured in number of edges) is at most D.

Each configuration entry corresponds to an edge (in the order returned by graph.edges()), with value 0 (not selected) or 1 (selected).

Type Parameters

• G - Graph type (e.g., SimpleGraph)
• W - Edge weight type (e.g., i32)

Example

use problemreductions::models::graph::BoundedDiameterSpanningTree;
use problemreductions::topology::SimpleGraph;
use problemreductions::{Problem, Solver, BruteForce};

let graph = SimpleGraph::new(5, vec![(0,1),(0,2),(0,3),(1,2),(1,4),(2,3),(3,4)]);
let problem = BoundedDiameterSpanningTree::new(graph, vec![1,2,1,1,2,1,1], 5, 3);

let solver = BruteForce::new();
let solution = solver.find_witness(&problem);
assert!(solution.is_some());

Implementations

impl<G: Graph, W: WeightElement> BoundedDiameterSpanningTree<G, W>

pub fn new( graph: G, edge_weights: Vec<W>, weight_bound: W::Sum, diameter_bound: usize, ) -> Self

Create a new Bounded Diameter Spanning Tree instance.

Panics

Panics if edge_weights length does not match the graph’s edge count, if any edge weight is not positive, or if diameter_bound is zero.

pub fn graph(&self) -> &G

Get a reference to the underlying graph.

pub fn edge_weights(&self) -> &[W]

Get the edge weights.

pub fn set_weights(&mut self, edge_weights: Vec<W>)

Set new edge weights.

pub fn weight_bound(&self) -> &W::Sum

Get the weight bound B.

pub fn diameter_bound(&self) -> usize

Get the diameter bound D.

pub fn num_vertices(&self) -> usize

Get the number of vertices in the underlying graph.

pub fn num_edges(&self) -> usize

Get the number of edges in the underlying graph.

pub fn edge_list(&self) -> &[(usize, usize)]

Get the ordered edge list.

pub fn is_weighted(&self) -> bool

Check whether this problem uses a non-unit weight type.

Trait Implementations

impl<G: Clone, W: Clone + WeightElement> Clone for BoundedDiameterSpanningTree<G, W>

where W::Sum: Clone,

fn clone(&self) -> BoundedDiameterSpanningTree<G, W>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<G: Debug, W: Debug + WeightElement> Debug for BoundedDiameterSpanningTree<G, W>

where W::Sum: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de, G, W> Deserialize<'de> for BoundedDiameterSpanningTree<G, W>

where G: Deserialize<'de>, W: Deserialize<'de> + WeightElement, W::Sum: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<G, W> Problem for BoundedDiameterSpanningTree<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "BoundedDiameterSpanningTree"

Base name of this problem type (e.g., “MaximumIndependentSet”).

type Value = Or

The evaluation value type.

fn variant() -> Vec<(&'static str, &'static str)>

Returns variant attributes derived from type parameters.

fn dims(&self) -> Vec<usize>

Configuration space dimensions. Each entry is the cardinality of that variable.

fn evaluate(&self, config: &[usize]) -> Or

Evaluate the problem on a configuration.

fn num_variables(&self) -> usize

Number of variables (derived from dims).

fn problem_type() -> ProblemType

Look up this problem’s catalog entry.

impl<G, W> Serialize for BoundedDiameterSpanningTree<G, W>

where G: Serialize, W: Serialize + WeightElement, W::Sum: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl DeclaredVariant for BoundedDiameterSpanningTree<SimpleGraph, i32>