Struct IsomorphicSpanningTree 

pub struct IsomorphicSpanningTree { /* private fields */ }

Isomorphic Spanning Tree problem.

Given an undirected graph G = (V, E) and a tree T = (V_T, E_T) with |V| = |V_T|, determine if there exists a bijection π: V_T → V such that for every edge {u, v} in E_T, {π(u), π(v)} is an edge in E.

Example

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

// Host graph: triangle 0-1-2-0
let graph = SimpleGraph::new(3, vec![(0, 1), (1, 2), (0, 2)]);
// Tree: path 0-1-2
let tree = SimpleGraph::new(3, vec![(0, 1), (1, 2)]);
let problem = IsomorphicSpanningTree::new(graph, tree);

let solver = BruteForce::new();
let sol = solver.find_satisfying(&problem);
assert!(sol.is_some());

Implementations

impl IsomorphicSpanningTree

pub fn new(graph: SimpleGraph, tree: SimpleGraph) -> Self

Create a new IsomorphicSpanningTree problem.

Panics

Panics if |V(G)| != |V(T)| or if T is not a tree (not connected or wrong number of edges).

pub fn graph(&self) -> &SimpleGraph

Get a reference to the host graph.

pub fn tree(&self) -> &SimpleGraph

Get a reference to the target tree.

pub fn num_vertices(&self) -> usize

Get the number of vertices.

pub fn num_graph_edges(&self) -> usize

Get the number of edges in the host graph.

pub fn num_tree_edges(&self) -> usize

Get the number of edges in the target tree.

Trait Implementations

impl Clone for IsomorphicSpanningTree

fn clone(&self) -> IsomorphicSpanningTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for IsomorphicSpanningTree

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for IsomorphicSpanningTree

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Problem for IsomorphicSpanningTree

const NAME: &'static str = "IsomorphicSpanningTree"

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

type Metric = bool

The evaluation metric type.

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

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

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

Evaluate the problem on a configuration.

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

Returns variant attributes derived from type parameters.

fn num_variables(&self) -> usize

Number of variables (derived from dims).

fn problem_type() -> ProblemType

Look up this problem’s catalog entry.

impl Serialize for IsomorphicSpanningTree

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 IsomorphicSpanningTree

impl SatisfactionProblem for IsomorphicSpanningTree