pub struct GraphDivergence { /* private fields */ }Expand description
What one selected topology says about the partition its graph declares.
Implementations§
Source§impl GraphDivergence
impl GraphDivergence
Sourcepub fn cohesion(&self) -> &[ModuleCohesion]
pub fn cohesion(&self) -> &[ModuleCohesion]
Every partition’s cohesion, in root-id order.
Sourcepub fn modularity(&self) -> Option<f64>
pub fn modularity(&self) -> Option<f64>
The directed Newman modularity of the declared partition, or nothing at all when the selection admits no edge.
Sourcepub fn candidates(&self) -> &[MisplacementCandidate]
pub fn candidates(&self) -> &[MisplacementCandidate]
Every symbol’s foreign-partition calls, by symbol then candidate.
Sourcepub fn boundary_components(&self) -> &[BoundaryCrossingComponent]
pub fn boundary_components(&self) -> &[BoundaryCrossingComponent]
Every cycle that runs through more than one partition, in component order.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for GraphDivergence
impl RefUnwindSafe for GraphDivergence
impl Send for GraphDivergence
impl Sync for GraphDivergence
impl Unpin for GraphDivergence
impl UnsafeUnpin for GraphDivergence
impl UnwindSafe for GraphDivergence
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