pub struct SteinerTreeResult {
pub used_node_indices: HashSet<usize>,
pub used_edge_endpoints: HashSet<(usize, usize)>,
}Expand description
Solution to a minimum Steiner tree problem.
This struct is created by the steiner_tree function.
Fields§
§used_node_indices: HashSet<usize>§used_edge_endpoints: HashSet<(usize, usize)>Auto Trait Implementations§
impl Freeze for SteinerTreeResult
impl RefUnwindSafe for SteinerTreeResult
impl Send for SteinerTreeResult
impl Sync for SteinerTreeResult
impl Unpin for SteinerTreeResult
impl UnsafeUnpin for SteinerTreeResult
impl UnwindSafe for SteinerTreeResult
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more