pub struct Closeness {
pub scores: Vec<f64>,
pub reachable_count: Vec<i64>,
pub all_reachable: bool,
}Expand description
Closeness scores together with reachability information, returned by
closeness_reachability.
Fields§
§scores: Vec<f64>The closeness centrality of each requested vertex (NaN for vertices that reach no other vertex).
reachable_count: Vec<i64>For each requested vertex, the number of vertices reachable from it (within the cutoff, if any), not counting the vertex itself.
all_reachable: boolWhether every vertex of the graph was reachable from each requested
vertex. false proves that the graph is disconnected; true proves it
is connected if the graph is undirected, or if it is directed and all
vertices were requested.
Trait Implementations§
impl StructuralPartialEq for Closeness
Auto Trait Implementations§
impl Freeze for Closeness
impl RefUnwindSafe for Closeness
impl Send for Closeness
impl Sync for Closeness
impl Unpin for Closeness
impl UnsafeUnpin for Closeness
impl UnwindSafe for Closeness
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