Struct MinimumUnionCycle

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

| not sure yet TODO |

Implementations

impl<GH> MinimumUnionCycle<GH>

where GH: GetConnectedComponentSizes + ExtendWith<GH> + GetEdges + GetNeighborsForNode + GetNodeIdRange + HasMapForNode + InsertEdge + InsertNode + MappedNodes + NumEdges + NumNodes,

pub fn vertex_map(&self) -> LockResult<MutexGuard<'_, ConnVertexMap>>

pub fn set_muc_subgraph(&mut self, gh: GH)

pub fn insert_subgraph(&mut self, idx: NodeId, g: Arc<GH>)

pub fn clear_conn_vertex_map(&mut self)

pub fn id(&self) -> MinimumUnionCycleId

pub fn set_id(&mut self, new: usize)

pub fn clear_subgraph_map(&mut self)

pub fn invalidate(&mut self)

pub fn connection_vertices( &self, ) -> Result<Vec<ConnectionVertexDescriptor>, BetweennessCentralityError>

pub fn bridges(&self) -> Result<Vec<Edge>, BetweennessCentralityError>

pub fn insert_conn_vertex( &mut self, id: NodeId, nbr: NodeId, ) -> Result<(), BetweennessCentralityError>

| make sure the node with @id exists in | the muc! this function will blindly | insert it |

pub fn compute_bc_initialize(&mut self)

pub fn compute_bc_initialize_tmp_conn_vertex_map( &mut self, ) -> Result<(), BetweennessCentralityError>

pub fn compute_bc_initialize_tmp_subgraph_map( &mut self, ) -> Result<(), BetweennessCentralityError>

pub fn initialize_scores_for_muc_subgraph(&self, scores: &mut BetweennessScores)

pub fn adjust_max_iter(&self, max_iter: Option<usize>) -> usize

pub fn initialize_bfs_for_node_in_the_muc(&mut self, source: NodeId)

pub fn build_stack_for_bfs(&mut self) -> NodeIdStack

pub fn bfs_process_stack_item( &mut self, v_n: NodeId, source: NodeId, scores: &mut BetweennessScores, )

pub fn do_bfs_for_node_in_the_muc( &mut self, source: NodeId, scores: &mut BetweennessScores, )

pub fn do_bf_searches_from_the_nodes_in_the_muc( &mut self, max_iter: usize, scores: &mut BetweennessScores, )

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

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

pub fn compute_bc_inc( &mut self, scores: &mut BetweennessScores, src: NodeId, dst: NodeId, max_iter: Option<usize>, ) -> Result<(), BetweennessCentralityError>

pub fn iteration( &mut self, source: NodeId, src: NodeId, dst: NodeId, src_distance: f64, dst_distance: f64, scores: &mut BetweennessScores, )

pub fn iteration_1_process( &mut self, v_n: NodeId, source: NodeId, src: NodeId, dst: NodeId, src_distance: f64, dst_distance: f64, scores: &mut BetweennessScores, ) -> Result<(), BetweennessCentralityError>

pub fn iteration_1( &mut self, source: NodeId, src: NodeId, dst: NodeId, src_distance: f64, dst_distance: f64, scores: &mut BetweennessScores, ) -> Result<(), BetweennessCentralityError>

pub fn iteration_2( &mut self, source: NodeId, src: NodeId, dst: NodeId, src_distance: f64, dst_distance: f64, scores: &mut BetweennessScores, ) -> Result<(), BetweennessCentralityError>

Trait Implementations

impl<GH> Debug for MinimumUnionCycle<GH>

where GH: ExtendWith<GH> + GetConnectedComponentSizes + GetEdges + GetNeighborsForNode + GetNodeIdRange + HasMapForNode + InsertEdge + InsertNode + MappedNodes + NumEdges + NumNodes + SetPrintNodes + Debug,

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

Formats the value using the given formatter.

impl<GH> Default for MinimumUnionCycle<GH>

fn default() -> Self

Returns the “default value” for a type.

impl<GH> ExtendWith<MinimumUnionCycle<GH>> for MinimumUnionCycle<GH>

where GH: GetConnectedComponentSizes + ExtendWith<GH, Error = BetweennessCentralityError> + GetEdges + GetNeighborsForNode + GetNodeIdRange + HasMapForNode + InsertEdge + InsertNode + MappedNodes + NumEdges + NumNodes,

fn extend_with( &mut self, other: &MinimumUnionCycle<GH>, ) -> Result<(), Self::Error>

muc1 = muc1 U muc2

1. copy the graph of muc2 into muc1

2. for each bridge edge, if the other end becomes in the graph, add the edge

type Error = BetweennessCentralityError

impl<GH> GetEdges for MinimumUnionCycle<GH>

where GH: GraphHashMucInterface,

fn edges(&self) -> &Edges

impl<GH> GetPrintNodes for MinimumUnionCycle<GH>

where GH: GraphHashMucInterface,

fn get_print_nodes(&self) -> bool

impl<GH> HasMapForNode for MinimumUnionCycle<GH>

where GH: GraphHashMucInterface,

fn has_map_for_node(&self, n: NodeId) -> bool

impl<GH> InsertEdge for MinimumUnionCycle<GH>

where GH: GraphHashMucInterface,

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

impl<GH> InsertNode for MinimumUnionCycle<GH>

where GH: GraphHashMucInterface,

fn insert_node(&mut self, n: NodeId)

impl<GH> IsValid for MinimumUnionCycle<GH>

fn is_valid(&self) -> bool

impl<GH> MappedNodes for MinimumUnionCycle<GH>

where GH: GraphHashMucInterface,

fn mapped_nodes(&self) -> Vec<NodeId>

impl<GH> Named for MinimumUnionCycle<GH>

fn name(&self) -> Cow<'_, str>

Returns the name associated with self. We use Cow to allow both owned and borrowed strings.

impl<GH> NumEdges for MinimumUnionCycle<GH>

where GH: GraphHashMucInterface,

fn num_edges(&self) -> usize

impl<GH> NumNodes for MinimumUnionCycle<GH>

where GH: GraphHashMucInterface,

fn num_nodes(&self) -> usize

impl<GH> SetPrintNodes for MinimumUnionCycle<GH>

where GH: GraphHashMucInterface,

fn set_print_nodes(&self, val: bool)