Struct BiconnectedComponentsScratch 

pub struct BiconnectedComponentsScratch<GH> { /* private fields */ }

Implementations

impl<GH> BiconnectedComponentsScratch<GH>

where GH: DebugIterationStep + FindPruningCounts + GetEdges + GetNeighborsForNode + GetNodeIdRange + GetSigmaValueForNode + HasEdge + InitDebugIteration + InsertEdge + MappedNodes + NumEdges + NumNodes + PairDependencyForNode + ParentsForNode + RemoveEdge,

pub fn bcc_fast_subgraph_label_map_outin(&self, n: NodeId) -> NodeId

pub fn bcc_subgraph_parents_for_node(&self, n: NodeId) -> Vec<NodeId>

pub fn bcc_subgraph_insert_edge(&mut self, e: &Edge)

pub fn bcc_subgraph_init_dbg_iteration(&mut self, s: NodeId)

pub fn bcc_subgraph_dbg_iteration_step( &mut self, v_s: &mut Vec<NodeId>, ) -> Result<(), BetweennessCentralityError>

pub fn bcc_subgraph_remove_edge( &mut self, edge: &Edge, ) -> Result<(), BetweennessCentralityError>

pub fn bcc_subgraph_num_nodes(&self) -> usize

pub fn bcc_subgraph_num_edges(&self) -> usize

pub fn bcc_subgraph_find_pruning_counts_exp( &mut self, src: NodeId, dst: NodeId, ) -> Result<(i32, i32, i32), BetweennessCentralityError>

pub fn bcc_subgraph_sigma_value_for_node(&self, node: NodeId) -> f64

pub fn bcc_subgraph_pair_dependency_for_node(&self, node: NodeId) -> f64

pub fn bcc_subgraph_mapped_nodes(&self) -> Vec<NodeId>

pub fn bcc_subgraph_has_edge(&self, e: &Edge) -> bool

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 bcc_fast_subgraph_reset_with_graphhash(&mut self)

pub fn set_articulation_point_map(&mut self, other: ArticulationPointMap)

pub fn bcc_subgraph(&self) -> &GH

pub fn bcc_subgraph_mut(&mut self) -> &mut GH

pub fn compute_bc( &mut self, scores: &mut BetweennessScores, max_iter: Option<usize>, ) -> Result<(), BetweennessCentralityError>

pub fn bc_iter( &mut self, s: NodeId, scores: &mut BetweennessScores, ) -> Result<(), BetweennessCentralityError>

Trait Implementations

impl<GH> CreateNamedEmpty for BiconnectedComponentsScratch<GH>

where GH: CreateNamedEmpty,

fn empty(name: &str) -> Self

impl<GH> Debug for BiconnectedComponentsScratch<GH>

where GH: GetPrintNodes + SetPrintNodes + Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.