pub struct Component { /* private fields */ }Expand description
| The component (subgraph along with other | needed information) that bc computation blocks | operate on. | | Could be a BiconnectedComponents, an | MinimumUnionCycle, or just a graph. |
Implementations§
Source§impl Component
impl Component
pub fn has_both_articulation_points(&self, x: NodeId, y: NodeId) -> bool
pub fn has_either_articulation_point(&self, x: NodeId, y: NodeId) -> bool
pub fn has_articulation_point(&self, x: NodeId) -> bool
pub fn articulation_point_map_reinit(&mut self, len: usize)
pub fn articulation_point_map_clear(&mut self)
pub fn num_mapped_articulation_points(&self) -> usize
pub fn subgraph_micentraltude_through_articulation_point( &self, source: NodeId, ) -> f64
pub fn subgraphs_product_through_articulation_points( &self, s: NodeId, n: NodeId, ) -> f64
pub fn map_articulation_point(&mut self, x: NodeId, sizes: &Vec<usize>)
pub fn articulation_point_map_iter(&self) -> Iter<'_, NodeId, Vec<usize>>
pub fn new_from_graph_ref<G>(g: &G, name: &str) -> Self
pub fn new_biconnected(name: &str) -> Self
pub fn subgraph(&self) -> &SubGraph
pub fn ty(&self) -> CompType
pub fn create_distance_maps( &self, edge: &Edge, ) -> Result<(DistanceMap, DistanceMap), BetweennessCentralityError>
pub fn reset_subgraph_with<GH>(&mut self, gh: &mut GH)
pub fn label_map_outin(&self, out: NodeId) -> NodeId
pub fn label_map_inout(&self, out: NodeId) -> NodeId
pub fn neighbors(&self, n: NodeId) -> Vec<NodeId>
pub fn num_nodes(&self) -> usize
pub fn insert_edge_between_nodes(&mut self, src: NodeId, dst: NodeId)
pub fn insert_edge(&mut self, edge: &Edge)
pub fn find_single_source_shortest_paths( &self, s: NodeId, ) -> Result<DistanceMap, BetweennessCentralityError>
pub fn remap_articulation_point_map(&mut self)
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Component
impl RefUnwindSafe for Component
impl Send for Component
impl Sync for Component
impl Unpin for Component
impl UnsafeUnpin for Component
impl UnwindSafe for Component
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PoisonMessage for Twhere
T: Debug,
impl<T> PoisonMessage for Twhere
T: Debug,
fn poison_message(&self) -> String
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.