pub struct HierarchicalDecomposition { /* private fields */ }Expand description
The hierarchical decomposition tree
Implementations§
Source§impl HierarchicalDecomposition
impl HierarchicalDecomposition
Sourcepub fn build(graph: Arc<DynamicGraph>) -> Result<Self>
pub fn build(graph: Arc<DynamicGraph>) -> Result<Self>
Build a new hierarchical decomposition from a graph
Sourcepub fn min_cut_value(&self) -> f64
pub fn min_cut_value(&self) -> f64
Get the current minimum cut value
Sourcepub fn min_cut_partition(&self) -> (HashSet<VertexId>, HashSet<VertexId>)
pub fn min_cut_partition(&self) -> (HashSet<VertexId>, HashSet<VertexId>)
Get the vertices on each side of the minimum cut
Source§impl HierarchicalDecomposition
impl HierarchicalDecomposition
Sourcepub fn level_info(&self) -> Vec<LevelInfo>
pub fn level_info(&self) -> Vec<LevelInfo>
Get information about each level
Auto Trait Implementations§
impl Freeze for HierarchicalDecomposition
impl !RefUnwindSafe for HierarchicalDecomposition
impl Send for HierarchicalDecomposition
impl Sync for HierarchicalDecomposition
impl Unpin for HierarchicalDecomposition
impl !UnwindSafe for HierarchicalDecomposition
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